Presentation | 2018-09-18 グラフの細分のスタックキューミックスレイアウト Miki Miyauchi, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | This paper shows that for every integer s, q >0, every graph G has an s-stack q-queue subdivision layout with 2 log_{s+q-1} sn(G) (resp. 2 log_{s+q-1} qn(G) +4) division vertices per edge. This paper improves previous results more, for graphs with larger stack number sn(G) or queue number qn(G) than given integers s and q. Also, the larger the given integer s is, the more this paper improves previous results. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | graph theory / graph layout / stack layout for graphs / queue layout for graphs / stack queue mixed layout for graphs |
Paper # | COMP2018-15 |
Date of Issue | 2018-09-11 (COMP) |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 2018/9/18(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | Kyusyu Institute of Technology |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | Toshihiro Fujito(Toyohashi Univ. of Tech.) |
Vice Chair | Shinichi Nakano(Gunma Univ.) |
Secretary | Shinichi Nakano(Kyoto Univ.) |
Assistant | Kazuhisa Seto(Seikei Univ.) |
Paper Information | |
Registration To | Technical Committee on Theoretical Foundations of Computing |
---|---|
Language | JPN-ONLY |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | |
Sub Title (in English) | |
Keyword(1) | graph theory |
Keyword(2) | graph layout |
Keyword(3) | stack layout for graphs |
Keyword(4) | queue layout for graphs |
Keyword(5) | stack queue mixed layout for graphs |
1st Author's Name | Miki Miyauchi |
1st Author's Affiliation | Nippon Telegraph and Telephone Corporation(NTT) |
Date | 2018-09-18 |
Paper # | COMP2018-15 |
Volume (vol) | vol.118 |
Number (no) | COMP-216 |
Page | pp.pp.41-48(COMP), |
#Pages | 8 |
Date of Issue | 2018-09-11 (COMP) |