Presentation 1997/9/26
Simultaneous planar drawing of some graphs
Kazuaki Yamaguchi, Yoshiki Akashi, Toshinobu Kashiwabara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) If each drawing of G_1=(V, E_1), G_2=(V, E_2),…, G_k=(V, E_k) is planar in a drawing of a graph G=(V, E_1 ∪ E_2 ∪…∪ E_k), the drawing of G is called a simultaneous planar drawing of G_1, G_2,…, and G_k. K-graphs sinultaneous planar problem is to examine if there exists any simultaneous planar drawing of G_1,…G_k or not. This paper proves that 3-graphs simultaneous planar problem is NP-complete.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) planar drawing / simultaneous planar drawing / NP-complete / multi-layer wiring
Paper # COMP97-39
Date of Issue

Conference Information
Committee COMP
Conference Date 1997/9/26(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) Simultaneous planar drawing of some graphs
Sub Title (in English)
Keyword(1) planar drawing
Keyword(2) simultaneous planar drawing
Keyword(3) NP-complete
Keyword(4) multi-layer wiring
1st Author's Name Kazuaki Yamaguchi
1st Author's Affiliation Department of electorical and electronics enginnering, Faculty of Engineering Kobe University()
2nd Author's Name Yoshiki Akashi
2nd Author's Affiliation Mitsubishi Electric
3rd Author's Name Toshinobu Kashiwabara
3rd Author's Affiliation Faculty of Engineering Science Osaka University
Date 1997/9/26
Paper # COMP97-39
Volume (vol) vol.97
Number (no) 290
Page pp.pp.-
#Pages 4
Date of Issue