Shortest perfect-matching reconfiguration via single alternating cycles is NP-hard for planar and bipartite graphs but polynomial-time solvable for outerplanar graphs.
Reconfiguration of maximum-weightb-matchings in a graph.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Shortest perfect-matching reconfiguration via single alternating cycles is NP-hard for planar and bipartite graphs but polynomial-time solvable for outerplanar graphs.