On the complexity of the Edge Label Placement problem

DOI10.1016/S0925-7721(00)00025-0MaRDI QIDQ5931366zbMATH OpenFDO

Authors Konstantinos G. Kakoulis, Ioannis G. Tollis

Publication date 2 January 2002

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(00)00025-0

zbMATH Keywords

computational complexityedge label placement

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Placing labels in road maps: algorithms and complexity
• Label placement in road maps
• Graph graphics: Theory and practice
• Fixed edge-length graph drawing is NP-hard
• Three rules suffice for good label placement

Cited in

(6)

• Modifying orthogonal drawings for label placement
• Algorithms for the multiple label placement problem
• Orthogonal drawings of graphs with vertex and edge labels
• Placing arrows in directed graph drawings
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• Fast sequential and parallel vertex relabelings of \({K_{m,m}}\)

This page was built for publication: On the complexity of the Edge Label Placement problem

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