2019
On the Complexity of Optimal Matching Reconfiguration
Search citation statements
Paper Sections
Select...
6
1
0
0
Citation Types
0
3
0
0
Year Published
2018
2023
Publication Types
Select...
2
2
2
Relationship
0
6
Authors
Journals
Cited by 6 publications
(3 citation statements)
References 8 publications
0
3
0
0
“…As mentioned, reconfiguration problems of matchings have already been studied under different models [8,9,6,3,2]. These models chose more elementary changes as the adjacency on the configuration space.…”
Section: Other Configuration Spaces For Matchingsmentioning
confidence: 99%
“…As mentioned, reconfiguration problems of matchings have already been studied under different models [8,9,6,3,2]. These models chose more elementary changes as the adjacency on the configuration space.…”
Section: Other Configuration Spaces For Matchingsmentioning
confidence: 99%
“…On the other hand, the shortest matching reconfiguration is known to be hard. Gupta et al [6] and Bousquet et al [3] independently proved that the problem is NP-hard under the token jumping model. Then, the problem is also NP-hard under the token addition/removal model, because the shortest lengths are preserved under the two models [9, Theorem 1].…”
Section: Other Configuration Spaces For Matchingsmentioning
confidence: 99%
