Graph Drawing

DOI10.1007/11618058zbMath1171.68609OpenAlexW4251892597MaRDI QIDQ5897627

Tim Dwyer, Kim Marriott, Peter J. Stuckey

Publication date: 13 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11618058

zbMATH Keywords

constrained optimizationgraph layoutseparation constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Graph Compact Orthogonal Layout Algorithm ⋮ 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 ⋮ Improved approximation algorithms for box contact representations ⋮ Efficient Node Overlap Removal Using a Proximity Stress Model ⋮ Removing Node Overlaps Using Multi-sphere Scheme ⋮ Constrained graph layout by stress majorization and gradient projection

This page was built for publication: Graph Drawing