Algorithms for width-parameters of digraphs and their applications

• Project/Area Number: 23500026
• Research Category: Grant-in-Aid for Scientific Research (C)
• Allocation Type: Multi-year Fund
• Section: 一般
• Research Field: Fundamental theory of informatics
• Research Institution: Meiji University
• Principal Investigator: TAMAKI Hisao 明治大学, 理工学部, 教授 (20111354)
• Project Period (FY): 2011 – 2013
• Project Status: Completed (Fiscal Year 2013)
• Budget Amount: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000); Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2012: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2011: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
• Keywords: 有向グラフ / パス幅 / 固定パラメータアルゴリズム / 厳密指数時間アルゴリズム / グラフ / 木幅 / 分枝幅 / 表面埋め込み / 種数 / グラフアルゴリズム / 木分割 / パス分割 / グラフ分割

Research Abstract

For the problem of computing the pathwidth of digraphs, an XP algorithm (with running time n to the O(k), where n is the number of vertices and k is the pathwidth, and an algorithm with running time O(1.89 to the nth), were developed. The first version of the XP algorithm contained an essential flaw, and a considerable amount of time was spent for fixing the error. As applications, FPT algorithms for two-layer graph drawing problems were developed.

Research Products

• [Journal Article] Search Space Reduction through Commitments in Pathwidth Computation: An Experimental Study (2014)
  • Author(s): Yasuaki Kobayashi, Keita Komuro, and Hisao Tamaki
  • Journal Title: Lecture Notes in Computer Science Volume: 未定
  • NAID: 110009925281
  • Peer Reviewed
• [Journal Article] Route-Enabling Graph Orientation Problems (2013)
  • Author(s): Takehiro Ito, Yuichiro Miyamoto, Hirotaka Ono, Hisao Tamaki, Ryuhei Uehara
  • Journal Title: Algorithmica Volume: 65(2) Pages: 317-338
  • NAID: 120005850325
• [Journal Article] A Linear Edge Kernel for Two-Layer Crossing Minimization (2013)
  • Author(s): Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki
  • Journal Title: COCOON Pages: 458-468
  • NAID: 110009768496
• [Journal Article] A Linear Edge Kernel for Two-Layer Crossing Minimization (2013)
  • Author(s): Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, and Hisao Tamaki
  • Journal Title: Lecture Notes in Computer Science Volume: 7936 Pages: 458-468
  • NAID: 110009768496
  • Peer Reviewed
• [Journal Article] Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size (2012)
  • Author(s): Qian-Ping Gu, Hisao Tamaki
  • Journal Title: Algorithmica Volume: 64(3) Pages: 416-453
• [Journal Article] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (2012)
  • Author(s): Yasuaki Kobayashi, Hisao Tamaki
  • Journal Title: ESA Pages: 683-694
• [Journal Article] Tracesheets - Spreadsheets of Program Executions as a Common Ground between Learners and Instructors (2012)
  • Author(s): Soichiro Fujii, Hisao Tamaki:
  • Journal Title: CSEDU 2012 Volume: 1 Pages: 158-163
  • Peer Reviewed
• [Journal Article] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (2012)
  • Author(s): Yasuaki Kobayashi, Hisao Tamaki:
  • Journal Title: ESA 2012 Volume: LNCS7501 Pages: 683-694
  • Peer Reviewed
• [Journal Article] Computing Directed Pathwidth in O(1.89^ n ) Time (2012)
  • Author(s): Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
  • Journal Title: IPEC 2012 Volume: LNCS7535 Pages: 182-193
  • Peer Reviewed
• [Journal Article] Improved bounds on the planar branchwidth with respect to the largest grid minor size (2012)
  • Author(s): Qian-Ping Gu and Hisao Tamaki
  • Journal Title: Algorithmica Volume: online first Issue: 3 Pages: 1-38
  • DOI: 10.1007/s00453-012-9627-5
  • Peer Reviewed
• [Journal Article] Computing Directed Pathwidth in O(1.89 n ) Time (2011)
  • Author(s): Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki, Toshihiro Tano
  • Journal Title: IPEC 2012 Pages: 182-193
• [Journal Article] Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n^<1+ϵ>) time (2011)
  • Author(s): Qian-Ping Gu, Hisao Tamaki
  • Journal Title: Theor. Comput. Sci Volume: 412(32) Pages: 4100-4109
• [Journal Article] A Polynomial Time Algorithm for Bounded Directed Pathwidth (2011)
  • Author(s): Hisao Tamaki
  • Journal Title: WG Pages: 331-342
• [Journal Article] Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n**{1+\epsilon}) time (2011)
  • Author(s): Qian-Ping Gu and Hisao Tamaki
  • Journal Title: Theoretical Computer Science Volume: 412 Issue: 32 Pages: 4100-4109
  • DOI: 10.1016/j.tcs.2010.07.017
  • Peer Reviewed
• [Presentation] A Linear Edge Kernel for Two-Layer Crossing Minimization (2013)
  • Author(s): Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki (Meiji Univ)
  • Organizer: 第144回アルゴリズム研究発表会
  • Place of Presentation: 情報処理学会
• [Presentation] A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (2012)
  • Author(s): 小林靖明, 玉木久夫
  • Organizer: 第141回アルゴリズム研究発表会
  • Place of Presentation: 情報処理学会
• [Presentation] Computing directed pathwidth in O(1.89^n) time (2012)
  • Author(s): 橘内謙太, 小林靖, 小室慶, 玉木久夫, 田野登志博
  • Organizer: 第141回アルゴリズム研究発表会
  • Place of Presentation: 情報処理学会
• [Presentation] A polynomial time algorithm for bounded directed pathwidth (2011)
  • Author(s): Hisao Tamaki
  • Organizer: 37th Intgernational workshop on graph-theoretic aspects of computer science
  • Place of Presentation: テプラ（チョコ）