𝔖 Bobbio Scriptorium

✦ LIBER ✦

[Lecture Notes in Computer Science] Graph Drawing Volume 1190 || Straight-line drawing algorithms for hierarchical graphs and clustered graphs

✍ Scribed by North, Stephen

Book ID: 121358004
Publisher: Springer Berlin Heidelberg
Year: 1997
Weight: 843 KB
Category: Article
ISBN: 3540680489
DOI: 10.1007/3-540-62495-3_42

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Straight-Line Drawing Algorithms for Hie

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs

✍ Peter Eades; Qingwen Feng; Xuemin Lin; Hiroshi Nagamochi 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 422 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Drawing Volume 1353 || Drawing clustered graphs on an orthogonal grid

✍ DiBattista, Giuseppe 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 904 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Drawing Volume 1984 || A Multilevel Algorithm for Force-Directed Graph Drawing

✍ Marks, Joe 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 616 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Drawing Volume 1190 || Circular layout in the Graph Layout toolkit

✍ North, Stephen 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg ⚖ 499 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

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph Drawing Volume 894 || Regular edge labelings and drawings of planar graphs

✍ Tamassia, Roberto; Tollis, Ioannis G. 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 468 KB