On the Complexity of the Hajos Calculus for Planar Graphs
Kyoto University (京都大学) === 0048 === 新制・課程博士 === 博士(情報学) === 甲第15538号 === 情博第396号 === 新制||情||72(附属図書館) === 28016 === 京都大学大学院情報学研究科通信情報システム専攻 === (主査)教授 岩間 一雄, 教授 湯淺 太一, 教授 永持 仁 === 学位規則第4条第1項該当...
Main Author: | Seto, Kazuhisa |
---|---|
Other Authors: | 岩間, 一雄 |
Format: | Others |
Language: | English |
Published: |
京都大学 (Kyoto University)
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/2433/120387 |
Similar Items
-
Hajos stable graphs
by: Manimuthu Yamuna, et al.
Published: (2018-04-01) -
Enumeration Algorithms for Colored and Rooted Outerplanar Graphs
by: WANG, Jiexun
Published: (2010) -
Graph Algorithmic Approaches for Structure Inferences in Bioinformatics
by: Tamura, Takeyuki
Published: (2008) -
Algorithms for graph theoretic optimization problems in bioinformatics
by: Yamaguchi, Atsuko
Published: (2011) -
Studies on Constant-Time Algorithms for Bounded-Degree Graphs and Constraint Satisfaction Problems
by: Yoshida, Yuichi
Published: (2012)