| 講演抄録/キーワード |
| 講演名 |
2007-09-20 15:15
The Complexity of the Hajos Calculus on Planar Graphs Yoichi Hanatani(Kyoto Univ.)・Takashi Horiyama(Saitama Univ.)・Kazuo Iwama・○Suguru Tamaki(Kyoto Univ.) COMP2007-38 |
| 抄録 |
(和) |
(まだ登録されていません) |
| (英) |
The planar Haj\'os calculus is the Haj\'os calculus with the restriction
that all the graphs that appear in the construction (including a final
graph) must be planar.
We prove that the planar Haj\'os calculus is polynomially bounded iff the
Haj\'os calculus is polynomially bounded. |
| キーワード |
(和) |
/ / / / / / / |
| (英) |
Hajos Calculus / graph coloring / planar graph / proof complexity / / / / |
| 文献情報 |
信学技報, vol. 107, no. 219, COMP2007-38, pp. 43-50, 2007年9月. |
| 資料番号 |
COMP2007-38 |
| 発行日 |
2007-09-13 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| PDFダウンロード |
COMP2007-38 |