AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH

DOI10.1142/S0218195996000101MaRDI QIDQ4889503zbMATHFDO

Authors Peter Eades, Xuemin Lin, Roberto Tamassia

Publication date 12 August 1996

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

graph drawinghierarchical graphsdegree weighted barycentre

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1974120
• An algorithm for blob hierarchy layout
• Graph Drawing
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• An algorithm for drawing general undirected graphs

Cited in

(13)

• An algorithm for drawing general undirected graphs
• On the computational complexity of edge concentration
• Towards area requirements for drawing hierarchically planar graphs
• Graph Drawing
• scientific article; zbMATH DE number 1942448 (Why is no real title available?)
• scientific article; zbMATH DE number 2084280 (Why is no real title available?)
• A flow formulation for horizontal coordinate assignment with prescribed width
• scientific article; zbMATH DE number 1974120 (Why is no real title available?)
• Drawing directed graphs clockwise
• A flow formulation for horizontal coordinate assignment with prescribed width
• An algorithm for blob hierarchy layout
• Drawing weighted directed graph from it’s adjacency matrix
• Spring algorithms and symmetry

This page was built for publication: AN ALGORITHM FOR DRAWING A HIERARCHICAL GRAPH

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889503)