Placement of Vertex Labels in a Graph Drawing(Graphs and Networks)

スポンサーリンク

概要

• 論文の詳細を見る

• Let G be an undirected graph and let F 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 T 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.

• 社団法人電子情報通信学会の論文
• 2004-10-01

著者

• Abe N

  Graduate School Of Science And Technology Kobe University

• Masuda S

  Department Of Electrical And Electronics Engineering Kobe University

• Masuda Sumio

  Department of Civil Environmental Engineering,Faculty of Engineering,Miyazaki University

• ABE Noboru

  Graduate School of Science and Technology, Kobe University

• YAMAGUCHI Kazuaki

  Department of Electrical and Electronics Engineering, Kobe University

• Yamaguchi Kazuaki

  Department Of Electrical And Electronics Engineering Kobe University

関連論文

• Bacterial characteristics within biofilms under low oxygen partial pressure
• Placement of Vertex Labels in a Graph Drawing(Graphs and Networks)
• An Algorithm for Drawing Undirected Graphs with Edge Labels
• An Algorithm for Placing Edge Labels in a Graph Drawing
• The adsorption and desorption of nitrogen oxide by the aqueous dispersion of the chelate resin-immobilized iron(II) complex.

スポンサーリンク