DMCA
On the Edge Label Placement Problem (1997)
| Venue: | Graph Drawing (Proc. GD '96 |
| Citations: | 18 - 3 self |
BibTeX
@INPROCEEDINGS{Kakoulis97onthe,
author = {Konstantinos G. Kakoulis and Ioannis G. Tollis},
title = {On the Edge Label Placement Problem},
booktitle = {Graph Drawing (Proc. GD '96},
year = {1997},
pages = {241--256},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. Let G(V;E) be a graph, and let f : G ! R 2 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 referred to 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. 1 Introduction In recent years graph drawing has received increasing attention due to the large number of applications, such as, entity relationship diagrams, software engineering diagrams, CASE tools, debugging tools, communication network...
Keyphrases
edge label placement problem elp problem labeling assignment line feature label placement edge label placement entity relationship diagram much effort communication network recent year software engineering diagram automated drawing large number text label automated cartography present time computational complexity issue little attention
