Presentation 2001/11/19
Three Equivalent Measures of Graphs Based on Drawing on the Plane
HIRO ITO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Let G=(N, c) be a graph (network) with a vertex set N={0, 1, ..., n-1} and real edge weight function c : V×V→R. Three measures for comparing two graphs are considered : (1) sum of edge length when the graph is drawn on a convex polygon, (2) sizes of linear-cuts, and (3) reducibility by using cross-operations. Three partial orders, corresponding the measures respectively, are alao introduced. This paper shows these three partial orders are equivalent.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) partial order / graph drawing / straight-line drawing / linear-cut / cyclic layout
Paper # CAS2001-76,CST2001-29
Date of Issue

Conference Information
Committee CST
Conference Date 2001/11/19(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 Concurrent System Technology (CST)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Three Equivalent Measures of Graphs Based on Drawing on the Plane
Sub Title (in English)
Keyword(1) partial order
Keyword(2) graph drawing
Keyword(3) straight-line drawing
Keyword(4) linear-cut
Keyword(5) cyclic layout
1st Author's Name HIRO ITO
1st Author's Affiliation Department of Communications and Computer Engineering, Graduate School of Informatics, Kyoto University()
Date 2001/11/19
Paper # CAS2001-76,CST2001-29
Volume (vol) vol.101
Number (no) 460
Page pp.pp.-
#Pages 7
Date of Issue