✦ LIBER ✦

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 2387 || Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs

✍ Scribed by Ibarra, Oscar H.; Zhang, Louxin

Book ID: 126240943
Publisher: Springer Berlin Heidelberg
Year: 2002
Weight: 187 KB
Category: Article
ISBN: 3540456554
DOI: 10.1007/3-540-45655-4_10

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 3595 || New Streaming Algorithms for Counting Triangles in Graphs

✍ Wang, Lusheng 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 166 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 3341 || Efficient Algorithms for the Longest Path Problem

✍ Fleischer, Rudolf; Trippen, Gerhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 204 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 3827 || Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph

✍ Deng, Xiaotie; Du, Ding-Zhu 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg ⚖ 245 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6196 || Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

✍ Thai, My T.; Sahni, Sartaj 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 161 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 4288 || Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems

✍ Asano, Tetsuo 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg ⚖ 408 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