On the complexity of the Edge Label Placement problem

DOI10.1016/S0925-7721(00)00025-0zbMath0976.68173MaRDI QIDQ5931366

Ioannis. G. Tollis, Konstantinos G. Kakoulis

Publication date: 2 January 2002

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

computational complexityedge label placement

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Related Items (6)

A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT ⋮ Placing Arrows in Directed Graph Drawings ⋮ Algorithms for the multiple label placement problem ⋮ Modifying orthogonal drawings for label placement ⋮ Fast Sequential and Parallel Vertex Relabelings of K_m,m ⋮ Orthogonal drawings of graphs with vertex and edge labels

Cites Work

• Unnamed Item

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