Shortest Reconfiguration of Matchings
- 12 September 2019
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 162-174
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Flip Distance Between Triangulations of a Simple Polygon is NP-CompleteDiscrete & Computational Geometry, 2015
- Flip distance between triangulations of a planar point set is APX-hardComputational Geometry, 2014
- The complexity of change2013
- Complexity of independent set reconfigurability problemsTheoretical Computer Science, 2012
- On the complexity of reconfiguration problemsTheoretical Computer Science, 2011
- The Connectivity of Boolean Satisfiability: Computational and Structural DichotomiesSIAM Journal on Computing, 2009
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- On the complexity of computing the diameter of a polytopecomputational complexity, 1994
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- The steiner problem in graphsNetworks, 1971