Placement of Vertex Labels in a Graph Drawing

Noboru ABE  Sumio MASUDA  Kazuaki YAMAGUCHI  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E87-A   No.10   pp.2774-2779
Publication Date: 2004/10/01
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Graphs and Networks
graph,  drawing,  labeling,  algorithm,  matching,  

Full Text: PDF>>
Buy this Article

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.