Reconfiguring spanning and induced subgraphs

Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the related results appear under the name of the property under consideration; for example, independent set, clique, and matching. In this paper, we systematically clarify the complexity status of subgraph reconfiguration with respect to graph structure properties.

本文言語English
ホスト出版物のタイトルComputing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings
編集者Daming Zhu, Lusheng Wang
出版社Springer Verlag
ページ428-440
ページ数13
ISBN(印刷版)9783319947754
DOI
出版ステータスPublished - 2018
イベント24th International Conference on Computing and Combinatorics Conference, COCOON 2018 - Qing Dao, China
継続期間: 2018 7 22018 7 4

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10976 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other24th International Conference on Computing and Combinatorics Conference, COCOON 2018
国/地域China
CityQing Dao
Period18/7/218/7/4

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Reconfiguring spanning and induced subgraphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル