• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2009 Fiscal Year Annual Research Report

アルゴリズム的グラフマイナー理論

Research Project

Project/Area Number 21650004
Research InstitutionNational Institute of Informatics

Principal Investigator

河原林 健一  National Institute of Informatics, プリンシプル研究系, 教授 (40361159)

Keywordsアルゴリズム / グラフ / マイナー / グラフマイナー理論 / 点素パス問題 / 多項式時間
Research Abstract

本研究では,そのタイトルの通り,「アルゴリズム的グラフマイナー理論」の研究を行っている.グラフマイナー理論は,グラフアルゴリズムの設計において非常に強力なツールとなり得る可能性が長年指摘されてきたが,グラフマイナー理論は極めて難解であるため,着手すらされていない状況が続いてきた.実際,500ページのも及ぶ膨大な証明は,離散数学を含め,多くの数学的知識が必要となってくるため,現在のところ,全世界で10人程度の専門家のみの貢献によって発展した理論である.また,この数学的に難解な理論のアルゴリズム的応用は,2005年までは全くなされてこなかった.
申請者は,海外のグラフアルゴリズム研究者とともに「アルゴリズム的グラフマイナー」プログラムを立ち上げ,その中心的人物としてプログラムを遂行中である.このプログラムは,マイナー操作に関して閉じているグラフに対する高速アルゴリズムの統一的な開発を目指す世界規模のプロジェクトであり,その動向は全世界の研究者の注目を集めている.そのいくつかの結果は,例えばSODA'09・'10,STOC'09などで発表されており,特に点素パスの研究分野から既に大きな反響を得ている.このプログラムは,純粋数学,理論計算機科学を巻き込む大きな流れを形成するプロジェクトとして当該分野の画期となり得るものであり,長期にわたってアルゴリズム分野に大きな影響を与える理論形成が期待されている.現在発展途上の理論であり,今後5年間は継続研究を行う予定である.

  • Research Products

    (26 results)

All 2010 2009 Other

All Journal Article (22 results) (of which Peer Reviewed: 22 results) Presentation (3 results) Remarks (1 results)

  • [Journal Article] Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements2010

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)

      Pages: 318-328

    • Peer Reviewed
  • [Journal Article] Decomposition, approximation, and coloring of odd-minor-free graphs2010

    • Author(s)
      E.Demaine, et al.
    • Journal Title

      ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)

      Pages: 329-344

    • Peer Reviewed
  • [Journal Article] The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs2010

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)

      Pages: 345-353

    • Peer Reviewed
  • [Journal Article] An(almost)linear time algorithm for odd cycles transversal2010

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      ACM-SIAM Symposium on Discrete Algorithms,(SODA'10)

      Pages: 365-378

    • Peer Reviewed
  • [Journal Article] Acyclic coloring and Star coloring surfaces2010

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      Siam J.Discrete Math. 24

      Pages: 56-71

    • Peer Reviewed
  • [Journal Article] Dominating sets in triangulations on surfaces2010

    • Author(s)
      T.Honjo, et al.
    • Journal Title

      J.Graph Theory 63

      Pages: 17-30

    • Peer Reviewed
  • [Journal Article] Planarity allowing few error vertices in linear time2009

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      50th Annual Symposium on Foundations of Computer Science(FOCS 2009)

      Pages: 639-648

    • Peer Reviewed
  • [Journal Article] Note on nonseparating and removable cycles in highly connected graphs2009

    • Author(s)
      S.Fujita, et al.
    • Journal Title

      Discrete Applied Math 159

      Pages: 398-399

    • Peer Reviewed
  • [Journal Article] A weakening of the odd Hadwiger's conjecture2009

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      Combinatorics, Probability and Computing 17

      Pages: 815-821

    • Peer Reviewed
  • [Journal Article] Long cycles without hamiltonian paths2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      Discrete Math 308

      Pages: 5899-5906

    • Peer Reviewed
  • [Journal Article] Highly parity linked graphs2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      Combinatorica 29

      Pages: 215-225

    • Peer Reviewed
  • [Journal Article] Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs2009

    • Author(s)
      E.Demaine, et al.
    • Journal Title

      35th International Colloquium on Automata, Languages and Programming(ICALP'09)

      Pages: 316-327

    • Peer Reviewed
  • [Journal Article] Hadwiger's Conjecture is decidable2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      the 41st ACM Symposium on Theory of Computing(STOC'09)

      Pages: 445-454

    • Peer Reviewed
  • [Journal Article] Note on coloring graphs without odd Kk-minors2009

    • Author(s)
      K.Kawarabayashi
    • Journal Title

      J.Combin.Theory Ser.B 99

      Pages: 728-731

    • Peer Reviewed
  • [Journal Article] Decomposing planar graphs of girth five into an independent set and a forest2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      J.Combin.Theory Ser.B 99

      Pages: 674-684

    • Peer Reviewed
  • [Journal Article] Algorithmic graph minor theory. Improved grid minor bounds and Wagner's contraction2009

    • Author(s)
      E.Demaine, et al.
    • Journal Title

      Algorithmica 54

      Pages: 142-180

    • Peer Reviewed
  • [Journal Article] Linear connectivity forces large complete bipartite minors2009

    • Author(s)
      T.Bohme, et al.
    • Journal Title

      J.Combin.Theory Ser.B 99

      Pages: 557-582

    • Peer Reviewed
  • [Journal Article] 6-critical graphs on the Klein bottle2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      Siam J.Discrete Math 23

      Pages: 372-383

    • Peer Reviewed
  • [Journal Article] N-flips in even triangulations on a surface2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      J.Combin.Theory Ser.B 99

      Pages: 229-246

    • Peer Reviewed
  • [Journal Article] On the number of 4-contractible edges in 4-connected graphs2009

    • Author(s)
      K.Ando, et al.
    • Journal Title

      J.Combin.Theory Ser.B 99

      Pages: 97-109

    • Peer Reviewed
  • [Journal Article] Removable cycles in non-bipartite graphs2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      J.Combin.Theory Ser.B 99

      Pages: 30-38

    • Peer Reviewed
  • [Journal Article] K_6-minor in triangulations in the Klein bottle2009

    • Author(s)
      K.Kawarabayashi, et al.
    • Journal Title

      Siam J.Discrete Math 23

      Pages: 96-108

    • Peer Reviewed
  • [Presentation] Graphs without subdivision2009

    • Author(s)
      K.Kawarabayashi
    • Organizer
      Danish Graph Theory
    • Place of Presentation
      Copenhagen
    • Year and Date
      2009-11-26
  • [Presentation] The disjoint paths problem, structure and algorithm2009

    • Author(s)
      K.Kawarabayashi
    • Organizer
      Fourth workshop in Graph Classes, Optimization, and Width Parameters, GROW 2009
    • Place of Presentation
      Bergen
    • Year and Date
      2009-10-15
  • [Presentation] Hadwiger's conjecture is decidable2009

    • Author(s)
      K.Kawarabayashi
    • Organizer
      The 6th Japan-Hungary conference in Discrete Math
    • Place of Presentation
      Budapest
    • Year and Date
      2009-05-16
  • [Remarks]

    • URL

      http://researchmap.jp/k_keniti/

URL: 

Published: 2011-06-16   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi