✦ LIBER ✦

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 570 || Approximating treewidth, pathwidth, and minimum elimination tree height

✍ Scribed by Schmidt, Gunther; Berghammer, Rudolf

Book ID: 125331175
Publisher: Springer Berlin Heidelberg
Year: 1992
Weight: 748 KB
Category: Article
ISBN: 3540467351
DOI: 10.1007/3-540-55121-2_1

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 903 || Multilevel graph grammars

✍ Mayr, Ernst W.; Schmidt, Gunther; Tinhofer, Gottfried 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 608 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 2573 || Budgeted Maximum Graph Coverage

✍ Goos, Gerhard; Hartmanis, Juris; van Leeuwen, Jan; Kučera, Luděk 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 839 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 903 || Rankings of graphs

✍ Mayr, Ernst W.; Schmidt, Gunther; Tinhofer, Gottfried 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 735 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Wireless Networking: Graph Theory Unplugged

✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 224 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 4769 || Tree-Width and Optimization in Bounded Degree Graphs

✍ Brandstädt, Andreas; Kratsch, Dieter; Müller, Haiko 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 366 KB

Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.). Includes Bibliographical References And Index. Also Issued Online.

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 2880 || Graph-Based Approaches to Software Watermarking

✍ Bodlaender, Hans L. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 199 KB