Removing node overlapping in graph layout using constrained optimization
From MaRDI portal
Publication:1405333
DOI10.1023/A:1022371615202zbMath1039.68121OpenAlexW1499393492MaRDI QIDQ1405333
Weiqing He, Kim Marriott, Vincent H. Tam, Peter J. Stuckey
Publication date: 25 August 2003
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022371615202
Related Items (6)
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
Uses Software
This page was built for publication: Removing node overlapping in graph layout using constrained optimization
