✦ LIBER ✦

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 5344 || On Independent Sets and Bicliques in Graphs

✍ Scribed by Broersma, Hajo; Erlebach, Thomas; Friedetzky, Tom; Paulusma, Daniel

Book ID: 118018445
Publisher: Springer Berlin Heidelberg
Year: 2008
Weight: 236 KB
Category: Article
ISBN: 3540922482
DOI: 10.1007/978-3-540-92248-3_16

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 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 2880 || Graph-Based Approaches to Software Watermarking

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

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A dynamic algorithm for line graph recognition

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 518 KB

[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 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] Grap

[Lecture Notes in Computer Science] Graph Drawing Volume 4372 || Biclique Edge Cover Graphs and Confluent Drawings

✍ Kaufmann, Michael; Wagner, Dorothea 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 440 KB