Fast Node Overlap Removal—Correction

DOI10.1007/978-3-540-70904-6_44MaRDI QIDQ3595497zbMATH OpenOpenAlexFDO

Authors Tim Dwyer, Kim Marriott, Peter J. Stuckey

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

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

Cited in

(3)

• Efficient Node Overlap Removal Using a Proximity Stress Model
• Graph Drawing
• FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595497)