Reconfiguration of cliques in a graph

Takehiro Ito, Hirotaka Ono, Yota Otachi

研究成果: Conference contribution

13 被引用数 (Scopus)

抄録

We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied in reconfiguration problems for independent sets. We first prove that all the three rules are equivalent in cliques. We then show that the problems are PSPACE-complete for perfect graphs, while we give polynomial-time algorithms for several classes of graphs, such as even-hole-free graphs and cographs. In particular, the shortest variant, which computes the shortest length of a desired sequence, can be solved in polynomial time for chordal graphs, bipartite graphs, planar graphs, and bounded treewidth graphs.

本文言語English
ホスト出版物のタイトルTheory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings
編集者Rahul Jain, Sanjay Jain, Frank Stephan
出版社Springer-Verlag
ページ212-223
ページ数12
ISBN(電子版)9783319171418
DOI
出版ステータスPublished - 2015 1 1
イベント12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015 - Singapore, Singapore
継続期間: 2015 5 182015 5 20

出版物シリーズ

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

Other

Other12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015
CountrySingapore
CitySingapore
Period15/5/1815/5/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Reconfiguration of cliques in a graph」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル