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