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

Development of Generic Algorithms Based on Graph Structural Parameters

Research Project

Project/Area Number 21K21278
Research Category

Grant-in-Aid for Research Activity Start-up

Allocation TypeMulti-year Fund
Review Section 1001:Information science, computer engineering, and related fields
Research InstitutionTohoku University

Principal Investigator

Tamura Yuma  東北大学, 情報科学研究科, 助教 (30907457)

Project Period (FY) 2021-08-30 – 2024-03-31
Project Status Completed (Fiscal Year 2023)
Budget Amount *help
¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2022: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2021: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Keywordsグラフアルゴリズム / グラフ理論 / 組合せ最適化 / 固定パラメータ容易性 / 最大誘導部分グラフ問題 / グラフパラメータ / 計算複雑性 / 最大幸福頂点集合問題 / 区間グラフ / 置換グラフ
Outline of Research at the Start

一般的に解くことが困難であるグラフ上の組合せ最適化問題においても,グラフの「木幅」に代表されるように,グラフの構造的パラメータを利用することで効率的に問題を解けるケースが多く知られている.一方で,近年になり,木幅より汎用的なパラメータが提案されている.本研究では,それら汎用的なパラメータに着目し,より多くのグラフに適用可能な効率的なアルゴリズムの構築を目的とする.

Outline of Final Research Achievements

For combinatorial optimization problems on graphs, we have developed efficient algorithms and proven the computational hardness from the perspective of graph structural parameters. Initially, our research focused on the maximum clique problem, which is a central problem in the field of graph algorithms, and provided the complexity dichotomy for specific structural parameters. Furthermore, by extending the methods for the maximum clique problem, we also revealed the computational complexity of a more generalized problem, the maximum induced subgraph problem.

Academic Significance and Societal Importance of the Research Achievements

本研究で得られたアルゴリズム及び困難性を証明する手法は,特定の性質を持つ任意の問題に対して適用可能である,という点で高い汎用性を持つ.本研究成果により,問題が特定の性質を持つかどうかを確認するだけで,本研究で扱った構造的パラメータに関して効率的なアルゴリズムが構築できそうかどうか判断が可能となった.これは構造的パラメータの分野における研究を大きく促進するものである.また,既存研究において組合せ最適化問題が扱いやすいと経験則的に知られていたグラフに対して,扱いやすいための共通構造を発見した.よって本研究はグラフ理論分野の発展にも貢献できたと考える.

Report

(4 results)
  • 2023 Annual Research Report   Final Research Report ( PDF )
  • 2022 Research-status Report
  • 2021 Research-status Report
  • Research Products

    (22 results)

All 2024 2023 2022

All Journal Article (8 results) (of which Peer Reviewed: 8 results,  Open Access: 1 results) Presentation (14 results) (of which Int'l Joint Research: 7 results)

  • [Journal Article] On the Complexity of List $$\mathcal H$$-Packing for Sparse Graph Classes2024

    • Author(s)
      Gima Tatsuya、Hanaka Tesshu、Kobayashi Yasuaki、Otachi Yota、Shirai Tomohito、Suzuki Akira、Tamura Yuma、Zhou Xiao
    • Journal Title

      Proceedings of the 18th International Conference and Workshop on Algorithms and Computation (WALCOM 2024)

      Volume: 14549 Pages: 421-435

    • DOI

      10.1007/978-981-97-0566-5_30

    • ISBN
      9789819705658, 9789819705665
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules2024

    • Author(s)
      Domon Naoki、Suzuki Akira、Tamura Yuma、Zhou Xiao
    • Journal Title

      Proceedings of the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), Lecture Notes in Computer Science (LNCS)

      Volume: 14549 Pages: 227-241

    • DOI

      10.1007/978-981-97-0566-5_17

    • ISBN
      9789819705658, 9789819705665
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized Complexity of Weighted Target Set Selection2024

    • Author(s)
      Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou
    • Journal Title

      Proceedings of Theory and Applications of Models of Computation - 18th Annual Conference (TAMC 2024)

      Volume: -

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Finding Induced Subgraphs from Graphs with Small Mim-Width2024

    • Author(s)
      Yota Otachi, Akira Suzuki, Yuma Tamura
    • Journal Title

      Proceedings of the 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024)

      Volume: -

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] On the Routing Problems in Graphs with Ordered Forbidden Transitions2023

    • Author(s)
      Kumakura Kota、Suzuki Akira、Tamura Yuma、Zhou Xiao
    • Journal Title

      Proceedings of the 29th International Computing and Combinatorics Conference (COCOON 2023), Lecture Notes in Computer Science (LNCS)

      Volume: 14422 Pages: 359-370

    • DOI

      10.1007/978-3-031-49190-0_26

    • ISBN
      9783031491894, 9783031491900
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized complexity of optimizing list vertex-coloring through reconfiguration2023

    • Author(s)
      Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou
    • Journal Title

      Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023), Lecture Notes in Computer Science (LNCS)

      Volume: 13973 Pages: 279-290

    • DOI

      10.1007/978-3-031-27051-2_24

    • ISBN
      9783031270505, 9783031270512
    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Journal Article] Decremental optimization of vertex-coloring under the reconfiguration framework2023

    • Author(s)
      Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura and Xiao Zhou
    • Journal Title

      International Journal of Computer Mathematics: Computer Systems Theory

      Volume: 8 Issue: 1 Pages: 80-92

    • DOI

      10.1080/23799927.2023.2185543

    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Journal Article] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki and Yuma Tamura
    • Journal Title

      Algorithmica

      Volume: - Issue: 11 Pages: 1-21

    • DOI

      10.1007/s00453-022-01081-0

    • Related Report
      2022 Research-status Report
    • Peer Reviewed
  • [Presentation] On the Complexity of List $\mathcal H$-Packing for Sparse Graph Classes2024

    • Author(s)
      Yuma Tamura
    • Organizer
      The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules2024

    • Author(s)
      Naoki Domon
    • Organizer
      The 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Parameterized Complexity of Weighted Target Set Selection2024

    • Author(s)
      Takahiro Suzuki
    • Organizer
      Theory and Applications of Models of Computation - 18th Annual Conference (TAMC 2024)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Finding Induced Subgraphs from Graphs with Small Mim-Width2024

    • Author(s)
      Yuma Tamura
    • Organizer
      The 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] List variants of packing problems on sparse graphs2024

    • Author(s)
      Yuma Tamura
    • Organizer
      情報処理学会 第196回アルゴリズム研究会
    • Related Report
      2023 Annual Research Report
  • [Presentation] Shortest path reconfiguration with relaxed constraints2024

    • Author(s)
      Naoki Domon
    • Organizer
      情報処理学会 第196回アルゴリズム研究会
    • Related Report
      2023 Annual Research Report
  • [Presentation] 点重み付きグラフにおける標的集合選択問題に関する研究2024

    • Author(s)
      鈴木 隆央
    • Organizer
      情報処理学会 第196回アルゴリズム研究会
    • Related Report
      2023 Annual Research Report
  • [Presentation] 遷移ルールの緩和に基づく独立集合遷移問題2024

    • Author(s)
      菅 達皓
    • Organizer
      2024年電子情報通信学会総合大会 COMP-AFSA学生シンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] Algorithms for weighted target set selection2024

    • Author(s)
      Takahiro Suzuki
    • Organizer
      2024年電子情報通信学会総合大会 COMP-AFSA学生シンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] On the Routing Problems in Graphs with Ordered Forbidden Transitions2023

    • Author(s)
      Kumakura Kota
    • Organizer
      The 29th International Computing and Combinatorics Conference (COCOON2023)
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] On the problems of finding paths to avoid ordered forbidden transitions based on graph structure2023

    • Author(s)
      Kota Kumakura
    • Organizer
      情報処理学会 第195回アルゴリズム研究会
    • Related Report
      2023 Annual Research Report
  • [Presentation] Parameterized complexity of optimizing list vertex-coloring through reconfiguration2023

    • Author(s)
      Yuma Tamura
    • Organizer
      The 17th International Conference and Workshops on Algorithms and Computation
    • Related Report
      2022 Research-status Report
    • Int'l Joint Research
  • [Presentation] Algorithms for happy set problem on interval graphs and permutation graphs,2022

    • Author(s)
      田村 祐馬
    • Organizer
      情報処理学会 第186回アルゴリズム研究会
    • Related Report
      2021 Research-status Report
  • [Presentation] Happy set problem on subclasses of co-comparability graphs2022

    • Author(s)
      田村 祐馬
    • Organizer
      The 16th International Conference and Workshops on Algorithms and Computation
    • Related Report
      2021 Research-status Report
    • Int'l Joint Research

URL: 

Published: 2021-10-22   Modified: 2025-01-30  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi