Reconfiguration of cliques in a graph

Takehiro Ito, Hirotaka Ono, Yota Otachi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (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.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Proceedings
EditorsRahul Jain, Sanjay Jain, Frank Stephan
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319171418
Publication statusPublished - 2015
Event12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015 - Singapore, Singapore
Duration: May 18 2015May 20 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other12th Annual Conference on Theory and Applications of Models of Computation, TAMC 2015

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Reconfiguration of cliques in a graph'. Together they form a unique fingerprint.

Cite this