2026-07-23T15:54:49Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11024 2024-03-06T10:47:05Z ddc:004 open_access

The Perfect Matching Reconfiguration Problem Bonamy, Marthe Bousquet, Nicolas Heinrich, Marc Ito, Takehiro Kobayashi, Yusuke Mary, Arnaud Mühlenthaler, Moritz Wasa, Kunihiro Combinatorial Reconfiguration Graph Algorithms Perfect Matching 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marthe Bonamy and Nicolas Bousquet and Marc Heinrich and Takehiro Ito and Yusuke Kobayashi and Arnaud Mary and Moritz Mühlenthaler and Kunihiro Wasa 2019 Is Part Of LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2019.80 urn:nbn:de:0030-drops-110248 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.80 eng https://creativecommons.org/licenses/by/3.0/legalcode