Algorithms for Cluster Busting in Anchored Graph Drawing

DOI10.7155/JGAA.00004MaRDI QIDQ4386509zbMATH OpenOpenAlexFDO

Authors Kelly Lyons, David Rappaport, Henk Meijer

Publication date 28 April 1998

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/47921

zbMATH Keywords

cluster busting in anchored graph drawing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Straight-line drawing algorithms for hierarchical graphs and clustered graphs
• Drawing \(c\)-planar biconnected clustered graphs
• An approximation algorithm for clustering graphs with dominating diametral path
• Algorithms for drawing graphs: An annotated bibliography
• Algorithms and bounds for drawing directed graphs
• Approximate algorithms for graph clustering problem
• scientific article; zbMATH DE number 7746258
• Graph Drawing
• Drawing clustered graphs on disk arrangements
• Clustering algorithm of graphs

Cited in

(7)

• Efficient Node Overlap Removal Using a Proximity Stress Model
• A new algorithm for removing node overlapping in graph visualization
• Removing Node Overlaps Using Multi-sphere Scheme
• Node overlap removal algorithms: an extended comparative study
• Structural tolerance and Delaunay triangulation
• Node overlap removal by growing a tree
• Node overlap removal algorithms: a comparative study

This page was built for publication: Algorithms for Cluster Busting in Anchored Graph Drawing

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