✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 7676 || On the Hyperbolicity of Small-World and Tree-Like Random Graphs

✍ Scribed by Chao, Kun-Mao; Hsu, Tsan-sheng; Lee, Der-Tsai

Book ID: 121410414
Publisher: Springer Berlin Heidelberg
Year: 2012
Weight: 542 KB
Category: Article
ISBN: 3642352618
DOI: 10.1007/978-3-642-35261-4_31

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 650 || Parallel and on-line graph coloring algorithms

✍ Ibaraki, Toshihide; Inagaki, Yasuyoshi; Iwama, Kazuo; Nishizeki, Takao; Yamashit 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 527 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computations Volume 1004 || Weighted domination on cocomparability graphs

✍ Staples, John; Eades, Peter; Katoh, Naoki; Moffat, Alistair 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 592 KB

[Lecture Notes in Computer Science] How

[Lecture Notes in Computer Science] How the World Computes Volume 7318 || Randomness, Computation and Mathematics

✍ Cooper, S. Barry; Dawar, Anuj; Löwe, Benedikt 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 302 KB

This book constitutes the refereed proceedings of the Turing Centenary Conference and the 8th Conference on Computability in Europe, CiE 2012, held in Cambridge, UK, in June 2012. The 53 revised papers presented together with 6 invited lectures were carefully reviewed and selected with an acceptance

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 6507 || k-cyclic Orientations of Graphs

✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 238 KB

Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010. The 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Boo

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 6506 || Bounded Max-colorings of Graphs

✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 254 KB

[Lecture Notes in Computer Science] WALC

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 6552 || Counting Spanning Trees in Graphs Using Modular Decomposition

✍ Katoh, Naoki; Kumar, Amit 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 222 KB