On the Edge Label Placement Problem

Kakoulis, Konstantinos G. and Tollis, Ioannis G. (1997) On the Edge Label Placement Problem. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 241-256(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_52).

Full text not available from this repository.


Let G(V,E) be a graph, and let f:G->R² be a one to one function that produces a layout of a graph G on the plane. We consider the problem of assigning text labels to every edge of the graph such that the quality of the labeling assignment is optimal. This problem has been first encountered in automated cartography and has been refferedto as the Line Feature Label Placement (LFLP) problem. Even though much effort has been devoted over the last 15 years in the area of automated drawing of maps, the Edge Label Placement (ELP) problem has received little attention. In this paper we investigate computational complexity issues of the ELP problem, which have been open up to the present time. Specifically we prove that the ELP problem is NP-Hard.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-62495-3_52
Classifications: G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.630 Labeling
URI: http://gdea.informatik.uni-koeln.de/id/eprint/148

Actions (login required)

View Item View Item