Shortest reconfiguration of matchings
From MaRDI portal
Publication:2301540
Recommendations
Cited in
(8)- Feedback vertex set reconfiguration in planar graphs
- Shortest reconfiguration of perfect matchings via alternating cycles
- Reconfiguration of Spanning Trees with Many or Few Leaves
- On the complexity of optimal matching reconfiguration
- scientific article; zbMATH DE number 7525461 (Why is no real title available?)
- Inapproximability of shortest paths on perfect matching polytopes
- scientific article; zbMATH DE number 7525498 (Why is no real title available?)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar
This page was built for publication: Shortest reconfiguration of matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301540)