AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH
From MaRDI portal
Publication:4889503
DOI10.1142/S0218195996000101zbMath0854.68035MaRDI QIDQ4889503
Roberto Tamassia, Peter Eades, Xuemin Lin
Publication date: 12 August 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
A flow formulation for horizontal coordinate assignment with prescribed width ⋮ On the computational complexity of edge concentration ⋮ A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width ⋮ Spring algorithms and symmetry ⋮ Towards area requirements for drawing hierarchically planar graphs
This page was built for publication: AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH