IEICE TRANSACTIONS on Fundamentals
Placement of Vertex Labels in a Graph Drawing
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.10 pp.2774-2779
- Publication Date
- 2004/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Graphs and Networks
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Noboru ABE, Sumio MASUDA, Kazuaki YAMAGUCHI, "Placement of Vertex Labels in a Graph Drawing" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 10, pp. 2774-2779, October 2004, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_10_2774/_p
Copy
@ARTICLE{e87-a_10_2774,
author={Noboru ABE, Sumio MASUDA, Kazuaki YAMAGUCHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Placement of Vertex Labels in a Graph Drawing},
year={2004},
volume={E87-A},
number={10},
pages={2774-2779},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Placement of Vertex Labels in a Graph Drawing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2774
EP - 2779
AU - Noboru ABE
AU - Sumio MASUDA
AU - Kazuaki YAMAGUCHI
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2004
AB - 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.
ER -
English
