A new algorithm for removing node overlapping in graph visualization
From MaRDI portal
Publication:2372206
DOI10.1016/j.ins.2007.02.016zbMath1122.68144OpenAlexW2031908202MaRDI QIDQ2372206
Xiaodi Huang, Junbin Gao, Wei Lai, A. S. M. Sajeev
Publication date: 25 July 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2007.02.016
Related Items
FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing ⋮ Node Overlap Removal by Growing a Tree ⋮ Node overlap removal algorithms: a comparative study ⋮ Node Overlap Removal Algorithms: an Extended Comparative Study
Cites Work
- Unnamed Item
- Unnamed Item
- Constrained graph layout
- Removing node overlapping in graph layout using constrained optimization
- Removing edge-node intersections in drawings of graphs
- Two-dimensional packing algorithms for layout of disconnected graphs
- Tabu Search—Part I
- Tabu Search—Part II
- Scene recognition using genetic algorithms with semantic nets
- Algorithms for Cluster Busting in Anchored Graph Drawing
