Reconfiguration of cliques in a graph

DOI10.1007/978-3-319-17142-5_19zbMATH Open1462.05280arXiv1412.3976OpenAlexW1783801030MaRDI QIDQ2948468FDOQ2948468

Authors: Takehiro Ito, Hirotaka Ono, Yota Otachi 

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1412.3976

Recommendations

• Reconfiguration of cliques in a graph
• Independent set reconfiguration in cographs
• Shortest Paths between Shortest Paths and Independent Sets
• Complexity of independent set reconfigurability problems
• Reconfiguration of Colorable Sets in Classes of Perfect Graphs

zbMATH Keywords

chordal graphsplanar graphsbipartite graphsreconfiguration problemsbounded treewidth graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Cited In (15)

• Reconfiguring spanning and induced subgraphs
• Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis
• Reconfigurations in Graphs and Grids
• Shortest reconfiguration of perfect matchings via alternating cycles
• Introduction to reconfiguration
• Complexity of coloring reconfiguration under recolorability constraints
• The complexity of (list) edge-coloring reconfiguration problem
• Reconfiguration of regular induced subgraphs
• Transportation Problem Allowing Sending and Bringing Back
• Reconfiguration of cliques in a graph
• Reconfiguration of maximum-weight \(b\)-matchings in a graph
• The complexity of dominating set reconfiguration
• Hamiltonian cycle reconfiguration with answer set programming
• Recongo: bounded combinatorial reconfiguration with answer set programming
• Reconfiguration of Steiner trees in an unweighted graph

This page was built for publication: Reconfiguration of cliques in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948468)