Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Published 2022 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
Authors
Keywords
-
Journal
SIAM JOURNAL ON DISCRETE MATHEMATICS
Volume 36, Issue 2, Pages 1102-1123
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Online
2022-04-28
DOI
10.1137/20m1364370
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- (2021) Takeshi Yamada et al. THEORETICAL COMPUTER SCIENCE
- Flip Distances Between Graph Orientations
- (2020) Oswin Aichholzer et al. ALGORITHMICA
- An Asymptotically Improved Upper Bound on the Diameter of Polyhedra
- (2018) Noriyoshi Sukegawa DISCRETE & COMPUTATIONAL GEOMETRY
- Reconfiguration of maximum-weight b-matchings in a graph
- (2018) Takehiro Ito et al. JOURNAL OF COMBINATORIAL OPTIMIZATION
- Swapping colored tokens on graphs
- (2018) Katsuhisa Yamanaka et al. THEORETICAL COMPUTER SCIENCE
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
- (2017) Amer E. Mouawad et al. SIAM JOURNAL ON DISCRETE MATHEMATICS
- Finding Shortest Paths Between Graph Colourings
- (2015) Matthew Johnson et al. ALGORITHMICA
- Flip distance between two triangulations of a point set is NP-complete
- (2015) Anna Lubiw et al. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
- Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
- (2015) Oswin Aichholzer et al. DISCRETE & COMPUTATIONAL GEOMETRY
- Pancake Flipping is hard
- (2015) Laurent Bulteau et al. JOURNAL OF COMPUTER AND SYSTEM SCIENCES
- Swapping labeled tokens on graphs
- (2015) Katsuhisa Yamanaka et al. THEORETICAL COMPUTER SCIENCE
- Flip distance between triangulations of a planar point set is APX-hard
- (2014) Alexander Pilz COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
- A counterexample to the Hirsch Conjecture
- (2012) Francisco Santos ANNALS OF MATHEMATICS
- Complexity of independent set reconfigurability problems
- (2012) Marcin Kamiński et al. THEORETICAL COMPUTER SCIENCE
- On the complexity of reconfiguration problems
- (2010) Takehiro Ito et al. THEORETICAL COMPUTER SCIENCE
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExploreCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now