𝔖 Bobbio Scriptorium

✦ LIBER ✦

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 4769 || On Finding Graph Clusterings with Maximum Modularity

✍ Scribed by Brandstädt, Andreas; Kratsch, Dieter; Müller, Haiko

Book ID: 120495713
Publisher: Springer Berlin Heidelberg
Year: 2007
Tongue: German
Weight: 483 KB
Edition: 2008
Category: Article
ISBN: 3540748385
DOI: 10.1007/978-3-540-74839-7_12

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

[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 4769 || Proper Helly Circular-Arc Graphs

✍ Brandstädt, Andreas; Kratsch, Dieter; Müller, Haiko 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 382 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 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

[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 411 || On feedback problems in digraphs

✍ Nagl, Manfred 📂 Article 📅 1990 🏛 Springer Berlin Heidelberg ⚖ 814 KB