Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs (1999)

by Peter Eades , Qingwen Feng , Xuemin Lin , Hiroshi Nagamochi
Venue:Algorithmica
Citations:59 - 12 self

Document Versions

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs –Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi — 1999 — Algorithmica
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs –Peter Eades, Qing-wen Feng, Xuemin Lin — 1997 — Algorithmica
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs (Extended Abstract) –Peter Eades, Qingwen Feng, Xuemin Lin — 1997 — Algorithmica
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs –Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi — 1996 — Algorithmica
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs –Peter Eades, Qingwen Feng, Xuemin Lin, Hiroshi Nagamochi — 1996 — Algorithmica