✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms – ESA 2010 Volume 6346 || Local Graph Exploration and Fast Property Testing

✍ Scribed by de Berg, Mark; Meyer, Ulrich

Book ID: 120450022
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 123 KB
Category: Article
ISBN: 3642157750
DOI: 10.1007/978-3-642-15775-2_35

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms – ESA 2010 Volume 6346 || The Geodesic Diameter of Polygonal Domains

✍ de Berg, Mark; Meyer, Ulrich 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 241 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms — ESA 2002 Volume 2461 || Optimal Graph Exploration without Good Maps

✍ Möhring, Rolf; Raman, Rajeev 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 197 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms — ESA '95 Volume 979 || Interval graphs with side (and size) constraints

✍ Spirakis, Paul 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 793 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms Volume 450 || Local tournaments and proper circular arc graphs

✍ Asano, Tetsuo; Ibaraki, Toshihide; Imai, Hiroshi; Nishizeki, Takao 📂 Article 📅 1990 🏛 Springer Berlin Heidelberg ⚖ 605 KB

[Lecture Notes in Computer Science] Auto

[Lecture Notes in Computer Science] Automata, Languages and Programming Volume 6756 || Online Graph Exploration: New Results on Old and New Algorithms

✍ Aceto, Luca; Henzinger, Monika; Sgall, Jiří 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 250 KB

The two-volume set LNCS 6755 and LNCS 6756 constitutes the refereed proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, held in Zürich, Switzerland, in July 2011. The 114 revised full papers (68 papers for track A, 29 for track B, and 17 for track C)

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || Local Decoding and Testing for Homomorphisms

✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 494 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers