Algorithms for Cluster Busting in Anchored Graph Drawing
From MaRDI portal
Publication:4386509
DOI10.7155/jgaa.00004zbMath0892.68073OpenAlexW2097677742MaRDI QIDQ4386509
David Rappaport, Kelly Lyons, Henk G. 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
Related Items
A new algorithm for removing node overlapping in graph visualization ⋮ Node Overlap Removal by Growing a Tree ⋮ Node overlap removal algorithms: a comparative study ⋮ Node Overlap Removal Algorithms: an Extended Comparative Study ⋮ Efficient Node Overlap Removal Using a Proximity Stress Model ⋮ Removing Node Overlaps Using Multi-sphere Scheme ⋮ Structural tolerance and Delaunay triangulation
This page was built for publication: Algorithms for Cluster Busting in Anchored Graph Drawing