Presentation	2014-06-13 Algorithmic construction of track layouts of graph subdivisions Miki MIYAUCHI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	This paper studies the problem of track layout of bipartite graph subdivisions. Previously the author shows that for every integer d ≥ 2, every bipartite graph G_ (m≥n) has a (d,3)-track subdivision with ⌈log_dn⌉-1 division vertices per edge. This paper rewrites the construction proof from the algorithmic approach. By showing the construction algorithmically, the author insists that track layout problems of graphs also become an interesting problem from the aspect of algorithmic research as well as topological graph theory.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	graph drawing / bipartite graph / graph subdivision / track layout of graphs
Paper #	COMP2014-9
Date of Issue

Conference Information
Committee	COMP
Conference Date	2014/6/6(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)	Algorithmic construction of track layouts of graph subdivisions
Sub Title (in English)
Keyword(1)	graph drawing
Keyword(2)	bipartite graph
Keyword(3)	graph subdivision
Keyword(4)	track layout of graphs
1st Author's Name	Miki MIYAUCHI
1st Author's Affiliation	NTT Communication Science Laboratories, NTT Corporation()
Date	2014-06-13
Paper #	COMP2014-9
Volume (vol)	vol.114
Number (no)	80
Page	pp.pp.-
#Pages	6
Date of Issue