• 研究課題をさがす
  • 研究者をさがす
  • KAKENの使い方
  1. 課題ページに戻る

2019 年度 実施状況報告書

Using Containment Relations to Understand and Compute Width Parameters of Graphs

研究課題

研究課題/領域番号 18K11157
研究機関電気通信大学

研究代表者

BELMONTE Remy  電気通信大学, 大学院情報理工学研究科, 助教 (80780147)

研究期間 (年度) 2018-04-01 – 2023-03-31
キーワードWidth parameters / Reconfiguration / Parameterized complexity / Structural parameters
研究実績の概要

Over the last year, we have obtained the following results in relation with the project :
- Independent set reconfiguration parameterized by modular-width. Joint work with Tesshu Hanaka, Michael Lampis, Hirotaka Ono and Yota Otachi. We studied the parameterized complexity of the independent set reconfiguration problem. These results appeared in the proceedings of WG 2019.
- Tight complexity bounds for problems parameterized by rank-width. Joint work with Ignasi Sau. These results are accepted for publication at WG 2020.
Parameterized Complexity of (A, l)-Path Packing. Joint work with Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi5, Michael Lampis, Hirotaka Ono, and Yota Otachi. These results are accepted for publication at IWOCA 2020.
- Covering edges with triangles. Joint work with Kyohei Chiba, Hiro Ito, Atsuki Nagao, Michael Lampis and Yota Otachi. These results are submitted for journal publication.
- Parameterized complexity of Grundy Coloring (completed). Joint work with Tesshu Hanaka, Eun-Jung Kim, Michael Lampis, Hirotaka Ono, Yota Otachi and Florian Sikora. These results are accepted for publication at ESA 2020.

現在までの達成度 (区分)
現在までの達成度 (区分)

3: やや遅れている

理由

While some structural insight into the relationship between certain specific problems (parity variants of classical problems in particular) and width parameters for dense graphs (in particular clique-width) were obtained, the main goal of studying the interplay between those width parameters and specific containment relations has eluded our efforts. We hope to obtain more conclusive results in the remaining years of this project.

今後の研究の推進方策

We plan to pursue the lines of research initiated thus far, i.e., the study of the interplay between various algorithmic problems and width-parameters for dense graphs. Through this approach, we hope to gain further insight into the behavior of those very parameters. In addition, we will turn to algorithmic aspects of certain specific containment relations, e.g., vertex minors. By combining those two approaches, we hope to make significant steps towards the main goal of this project: computing width parameter decompositions through containment relations.

次年度使用額が生じた理由

Due to the onset of the Covid-19 pandemic in January and the ensuing travel restrictions imposed by the Japanese government in February and March this year, I was unable to spend the full amount of last fiscal year's funding. The research visits that were cancelled as a result will be performed during this fiscal year instead, provided the healthcare crisis and travel restrictions are resolved.

  • 研究成果

    (9件)

すべて 2020 2019 その他

すべて 国際共同研究 (2件) 雑誌論文 (4件) (うち国際共著 3件、 査読あり 3件) 学会発表 (3件)

  • [国際共同研究] LAMSADE/Universite Paris Dauphine(フランス)

    • 国名
      フランス
    • 外国機関名
      LAMSADE/Universite Paris Dauphine
  • [国際共同研究] LIRMM/Universite de Montpellier(フランス)

    • 国名
      フランス
    • 外国機関名
      LIRMM/Universite de Montpellier
  • [雑誌論文] Independent Set Reconfiguration Parameterized by Modular-Width2020

    • 著者名/発表者名
      Belmonte Remy、Hanaka Tesshu、Lampis Michael、Ono Hirotaka、Otachi Yota
    • 雑誌名

      Algorithmica

      巻: 82 ページ: 2586~2605

    • DOI

      https://doi.org/10.1007/s00453-020-00700-y

    • 査読あり / 国際共著
  • [雑誌論文] Parameterized (Approximate) Defective Coloring2020

    • 著者名/発表者名
      Belmonte Remy、Lampis Michael、Mitsou Valia
    • 雑誌名

      SIAM Journal on Discrete Mathematics

      巻: 34 ページ: 1084~1106

    • DOI

      https://doi.org/10.1137/18M1223666

    • 査読あり / 国際共著
  • [雑誌論文] Parameterized Complexity of Safe Set2020

    • 著者名/発表者名
      Belmonte Remy、Hanaka Tesshu、Katsikarelis Ioannis、Lampis Michael、Ono Hirotaka、Otachi Yota
    • 雑誌名

      Journal of Graph Algorithms and Applications

      巻: 24 ページ: 215~245

    • DOI

      https://doi.org/10.7155/jgaa.00528

  • [雑誌論文] Token Sliding on Split Graphs2020

    • 著者名/発表者名
      Belmonte Remy、Kim Eun Jung、Lampis Michael、Mitsou Valia、Otachi Yota、Sikora Florian
    • 雑誌名

      Theory of Computing Systems

      巻: Online ページ: Online

    • DOI

      https://doi.org/10.1007/s00224-020-09967-8

    • 査読あり / 国際共著
  • [学会発表] On the complexity of finding large odd induced subgraphs and odd colorings2020

    • 著者名/発表者名
      Ignasi Sau
    • 学会等名
      WG 2020
  • [学会発表] Parameterized Complexity of (A,l)-Path Packing2020

    • 著者名/発表者名
      Yota Otachi
    • 学会等名
      IWOCA 2020
  • [学会発表] Independent Set Reconfiguration Parameterized by Modular-Width2019

    • 著者名/発表者名
      Remy Belmonte
    • 学会等名
      WG 2019

URL: 

公開日: 2021-01-27  

サービス概要 検索マニュアル よくある質問 お知らせ 利用規程 科研費による研究の帰属

Powered by NII kakenhi