Node Overlap Removal Algorithms: an Extended Comparative Study

DOI10.7155/jgaa.00532zbMath1451.05225OpenAlexW3036761428MaRDI QIDQ5141647

Laurent Piccinini, Arnaud Sallaberry, Fati Chen, Pascal Poncelet

Publication date: 18 December 2020

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

Full work available at URL: https://doi.org/10.7155/jgaa.00532

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing

Uses Software

• OGDF
• JavaScript
• AGORA

Cites Work

• Unnamed Item
• Removing node overlapping in graph layout using constrained optimization
• Computing stable Demers cartograms
• Node overlap removal algorithms: a comparative study
• A new algorithm for removing node overlapping in graph visualization
• Node Overlap Removal by Growing a Tree
• Emergence of Scaling in Random Networks
• Efficient, Proximity-Preserving Node Overlap Removal
• Algorithms for Cluster Busting in Anchored Graph Drawing
• An open graph visualization system and its applications to software engineering
• Collective dynamics of ‘small-world’ networks
• Graph Drawing
• Graph Drawing

This page was built for publication: Node Overlap Removal Algorithms: an Extended Comparative Study