The Perfect Matching Reconfiguration Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

The Perfect Matching Reconfiguration Problem

Abstract

We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of length four. We are interested in the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem is PSPACE-complete even for split graphs and for bipartite graphs of bounded bandwidth with maximum degree five. We then investigate polynomial-time solvable cases. Specifically, we prove that the problem is solvable in polynomial time for strongly orderable graphs (that include interval graphs and strongly chordal graphs), for outerplanar graphs, and for cographs (also known as P_4-free graphs). Furthermore, for each yes-instance from these graph classes, we show that a linear number of flip operations is sufficient and we can exhibit a corresponding sequence of flip operations in polynomial time.
Fichier principal
Vignette du fichier
LIPIcs-MFCS-2019-80.pdf (1.06 Mo) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02335588 , version 1 (28-10-2019)

Identifiers

Cite

Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, et al.. The Perfect Matching Reconfiguration Problem. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.80⟩. ⟨hal-02335588⟩
154 View
314 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More