Studies on cores, hierarchy, and complexity on H-coloring problems
Kyoto University (京都大学) === 0048 === 新制・課程博士 === 博士(情報学) === 甲第11716号 === 情博第145号 === 新制||情||33(附属図書館) === 23359 === UT51-2005-D465 === 京都大学大学院情報学研究科通信情報システム専攻 === (主査)教授 岩間 一雄, 教授 永持 仁, 助教授 伊藤 大雄 === 学位規則第4条第1項該当...
Main Author: | Uejima, Akihiro |
---|---|
Other Authors: | 岩間, 一雄 |
Format: | Others |
Language: | English |
Published: |
京都大学 (Kyoto University)
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/2433/144801 |
Similar Items
-
Studies on Quantum Query Complexity for Oracle Identification Problems
by: Teruyama, Junichi
Published: (2013) -
STUDIES ON REGULARIZED NEWTON-TYPE METHODS FOR UNCONSTRAINED MINIMIZATION PROBLEMS AND THEIR GLOBAL COMPLEXITY BOUNDS
by: Ueda, Kenji
Published: (2012) -
General solution to standard H∞ control problems for infinite-dimensional systems
by: Kashima, Kenji
Published: (2011) -
Enumeration Algorithms for Colored and Rooted Outerplanar Graphs
by: WANG, Jiexun
Published: (2010) -
Studies on Single-Vehicle Scheduling Problems
by: Karuno, Yoshiyuki
Published: (2011)