Removing edge-node intersections in drawings of graphs

DOI10.1016/S0020-0190(01)00194-6MaRDI QIDQ1603534zbMATH OpenOpenAlexFDO

Authors Wei Lai, Peter Eades

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(01)00194-6

zbMATH Keywords

AlgorithmsGraph layoutLayout adjustmentNode-edge intersectionsOverlapping nodes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites work

• Algorithms for drawing graphs: An annotated bibliography
• Euclidean shortest paths in the presence of rectilinear barriers
• Finding minimum rectilinear distance paths in the presence of barriers

Cited in

(1)

• A new algorithm for removing node overlapping in graph visualization

This page was built for publication: Removing edge-node intersections in drawings of graphs

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