Presentation | 2001/4/9 An Algorithm for Labeling Edges in a Graph Drawing Noboru ABE, Sumio MASUDA, Kazuaki YAMAGUCHI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Let G be a graph and Γ be its drawing on a plane. Each edge in G has a label of specified size. We consider the problem of placing many edge labels in Γ in such a way that no label overlaps vertices, edges or other labels. Recently, Kakoulis and Tollis proposed a heuristic algorithm for this problem. In this paper, we improve their algorithm by refining the part for deciding the candidates of label positions and that for choosing the final label positions. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | graph / drawing / labeling / algorithm / matching |
Paper # | COMP2001-2 |
Date of Issue |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 2001/4/9(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Theoretical Foundations of Computing (COMP) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | An Algorithm for Labeling Edges in a Graph Drawing |
Sub Title (in English) | |
Keyword(1) | graph |
Keyword(2) | drawing |
Keyword(3) | labeling |
Keyword(4) | algorithm |
Keyword(5) | matching |
1st Author's Name | Noboru ABE |
1st Author's Affiliation | Graduate School of Science and Technology, Kobe University() |
2nd Author's Name | Sumio MASUDA |
2nd Author's Affiliation | Faculty of Engineering, Kobe University |
3rd Author's Name | Kazuaki YAMAGUCHI |
3rd Author's Affiliation | Faculty of Engineering, Kobe University |
Date | 2001/4/9 |
Paper # | COMP2001-2 |
Volume (vol) | vol.101 |
Number (no) | 5 |
Page | pp.pp.- |
#Pages | 8 |
Date of Issue |