✦ LIBER ✦

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 7551 || Which Multi-peg Tower of Hanoi Problems Are Exponential?

✍ Scribed by Golumbic, Martin Charles; Stern, Michal; Levy, Avivit; Morgenstern, Gila

Book ID: 118124743
Publisher: Springer Berlin Heidelberg
Year: 2012
Weight: 233 KB
Category: Article
ISBN: 3642346111
DOI: 10.1007/978-3-642-34611-8_11

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 7551 || Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs

✍ Golumbic, Martin Charles; Stern, Michal; Levy, Avivit; Morgenstern, Gila 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 225 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Exact (Exponential) Algorithms for the Dominating Set Problem

✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 220 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Theoretic Concepts in Computer Science Volume 6410 || Colouring Vertices of Triangle-Free Graphs

✍ Thilikos, Dimitrios M. 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 189 KB

The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japa

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 314 || Development of several reachability algorithms for directed graphs

✍ Göttler, Herbert; Schneider, Hana-Jürgen 📂 Article 📅 1988 🏛 Springer Berlin Heidelberg ⚖ 544 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 4288 || Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules

✍ Asano, Tetsuo 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 446 KB

[Lecture Notes in Computer Science] STAC

[Lecture Notes in Computer Science] STACS 99 Volume 1563 || In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?

✍ Meinel, Christoph; Tison, Sophie 📂 Article 📅 1999 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 110 KB

This Book Constitutes The Refereed Proceedings Of The 16th Annual Symposium On Theoretical Aspects Of Computer Science, Stacs 99, Held In Trier, Germany In March 1999. The 51 Revised Full Papers Presented Were Selected From A Total Of 146 Submissions. Also Included Are Three Invited Papers. The Volu