标题
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
作者
关键词
-
出版物
SIAM JOURNAL ON DISCRETE MATHEMATICS
Volume 36, Issue 2, Pages 1102-1123
出版商
Society for Industrial & Applied Mathematics (SIAM)
发表日期
2022-04-28
DOI
10.1137/20m1364370
参考文献
相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。- 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
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationBecome a Peeref-certified reviewer
The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.
Get Started