For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Placement of Vertex Labels in a Graph Drawing
Noboru ABE Sumio MASUDA Kazuaki YAMAGUCHI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2004/10/01
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Graphs and Networks
graph, drawing, labeling, algorithm, matching,
Full Text: PDF(346.1KB)>>
Let G be an undirected graph and let Γ be its drawing on a plane. Each vertex in G has a label with a specified size. In this paper, we consider the problem of placing the maximum number of vertex labels in Γ in such a way that they do not overlap any vertices, edges or other labels. By refining several portions of the Kakoulis-Tollis algorithm for labeling graphical features, we present a heuristic algorithm for this problem. Experimental results show that our algorithm can place more labels than previous algorithms.