Shortest reconfiguration of matchings

DOI10.1007/978-3-030-30786-8_13OpenAlexW2976085618MaRDI QIDQ2301540

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

Publication date: 24 February 2020

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

zbMATH Keywords

matchingsfixed-parameter tractabilityreconfigurationapproximation hardness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Shortest Reconfiguration of Perfect Matchings via Alternating Cycles ⋮ Feedback vertex set reconfiguration in planar graphs ⋮ Inapproximability of shortest paths on perfect matching polytopes ⋮ Reconfiguration of Spanning Trees with Many or Few Leaves ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Shortest reconfiguration of matchings