Fast Node Overlap Removal—Correction

DOI10.1007/978-3-540-70904-6_44zbMath1185.68470OpenAlexW1496177362MaRDI QIDQ3595497

Tim Dwyer, Peter J. Stuckey, Kim Marriott

Publication date: 28 August 2007

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_44

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 (1)

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

This page was built for publication: Fast Node Overlap Removal—Correction