# Shortest Reconfiguration of Matchings

Nicolas Bousquet, Tatsuhiko Hatanaka, Takehiro Ito, Moritz Mühlenthaler

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

3 Citations (Scopus)

## Abstract

Imagine that unlabelled tokens are placed on edges forming a matching of a graph. A token can be moved to another edge provided that the edges containing tokens remain a matching. The distance between two configurations of tokens is the minimum number of moves required to transform one into the other. We study the problem of computing the distance between two given configurations. We prove that if source and target configurations are maximal matchings, then the problem admits no polynomial-time sublogarithmic-factor approximation algorithm unless &#x0024;&#x0024;\mathsf{P}= \mathsf{NP}&#x0024;&#x0024;. On the positive side, we show that for matchings of bipartite graphs the problem is fixed-parameter tractable parameterized by the size d of the symmetric difference of the two given configurations. Furthermore, we obtain a &#x0024;&#x0024;d^\varepsilon &#x0024;&#x0024; -factor approximation algorithm for the distance of two maximum matchings of bipartite graphs for every &#x0024;&#x0024;\varepsilon > 0&#x0024;&#x0024;. The proofs of our positive results are constructive and can hence be turned into algorithms that output shortest transformations. Both algorithmic results rely on a close connection to the Directed Steiner Tree problem. Finally, we show that determining the exact distance between two configurations is complete for the class &#x0024;&#x0024;\mathsf{D}^\mathsf{P}&#x0024;&#x0024;, and determining the maximum distance between any two configurations of a given graph is &#x0024;&#x0024;\mathsf{D}^\mathsf{P}&#x0024;&#x0024; -hard.

Original language English Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Revised Papers Ignasi Sau, Dimitrios M. Thilikos Springer Verlag 162-174 13 9783030307851 https://doi.org/10.1007/978-3-030-30786-8_13 Published - 2019 Yes 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 - Catalonia, SpainDuration: 2019 Jun 19 → 2019 Jun 21

### Publication series

Name Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11789 LNCS 0302-9743 1611-3349

### Conference

Conference 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019 Spain Catalonia 19/6/19 → 19/6/21

## Keywords

• Approximation hardness
• Fixed-parameter tractability
• Matchings
• Reconfiguration

## ASJC Scopus subject areas

• Theoretical Computer Science
• Computer Science(all)

## Fingerprint

Dive into the research topics of 'Shortest Reconfiguration of Matchings'. Together they form a unique fingerprint.