Reconfiguring spanning and induced subgraphs

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

研究成果: Article査読

2 被引用数 (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
ページ(範囲)553-566
ページ数14
ジャーナルTheoretical Computer Science
806
DOI
出版ステータスPublished - 2020 2 2

ASJC Scopus subject areas

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

フィンガープリント

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

引用スタイル