Presentation	2010-03-01 Track layout of bipartite graph with single-color edges 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. Dujmovic and Wood showed that every graph G has a (d+2)-track subdivision with 8[log_d qn(G)]+1 division vertices per edge. This paper improves this result for the case of bipartite graphs G_(m≥n) with m and n partite sets, and shows that for every integer d≥2, every bipartite graph G_(m≥n) has a (d+2)-track subdivision with 4[log_d n] division vertices per edge.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	graph drawing / bipartite graph / subdivision / track layout of graphs
Paper #	CAS2009-91,SIP2009-136,CS2009-86
Date of Issue

Conference Information
Committee	CS
Conference Date	2010/2/22(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	Communication Systems (CS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Track layout of bipartite graph with single-color edges
Sub Title (in English)
Keyword(1)	graph drawing
Keyword(2)	bipartite graph
Keyword(3)	subdivision
Keyword(4)	track layout of graphs
1st Author's Name	Miki MIYAUCHI
1st Author's Affiliation	NTT Communication Science Laboratories, NTT Corporation()
Date	2010-03-01
Paper #	CAS2009-91,SIP2009-136,CS2009-86
Volume (vol)	vol.109
Number (no)	436
Page	pp.pp.-
#Pages	6
Date of Issue