The Perfect Matching Reconfiguration Problem
From MaRDI portal
Recommendations
- Shortest reconfiguration of perfect matchings via alternating cycles
- Shortest reconfiguration of perfect matchings via alternating cycles
- On the complexity of optimal matching reconfiguration
- Reconfiguration of maximum-weight b-matchings in a graph
- Reconfiguration of maximum weight \(b\)-matchings in a graph
Cites work
- Complexity of independent set reconfigurability problems
- Counting perfect matchings and the switch chain
- Flip distance between two triangulations of a point set is NP-complete
- Flipping edges in triangulations
- Graphs of triangulations and perfect matchings
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- scientific article; zbMATH DE number 512914 (Why is no real title available?)
- scientific article; zbMATH DE number 1107732 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Independent set reconfiguration in cographs and their generalizations
- Introduction to reconfiguration
- Linear-time algorithm for sliding tokens on trees
- On counting perfect matchings in general graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- On the complexity of reconfiguration problems
- On the Parameterized Complexity for Token Jumping on Graphs
- On the switch Markov chain for perfect matchings
- Parameterized complexity of graph constraint logic
- Partitions and Their Representative Graphs
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguring independent sets in claw-free graphs
- Relationships between nondeterministic and deterministic tape complexities
- Spaces of domino tilings
- Statistical problems involving permutations with restricted positions
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Switching Distance Between Graphs with the Same Degrees
- The complexity of change
- Token jumping in minor-closed classes
Cited in
(19)- TS-reconfiguration of dominating sets in circle and circular-arc graphs
- On the complexity of optimal matching reconfiguration
- Shortest reconfiguration of matchings
- Shortest reconfiguration of perfect matchings via alternating cycles
- Shortest reconfiguration of perfect matchings via alternating cycles
- On reachable assignments under dichotomous preferences
- Inapproximability of shortest paths on perfect matching polytopes
- On the longest flip sequence to untangle segments in the plane
- Short flip sequences to untangle segments in the plane
- Reachability of fair allocations via sequential exchanges
- Reconfiguring planar perfect matchings via bounded length alternating cycles
- Inapproximability of shortest paths on perfect matching polytopes
- A generalized matching reconfiguration problem
- Independent set reconfiguration on directed graphs
- Reconfiguration of labeled matchings in triangular grid graphs
- Reconfiguration of labeled matchings in triangular grid graphs
- The tape reconfiguration problem and its consequences for dominating set reconfiguration
- Flipping odd matchings in geometric and combinatorial settings
- Reachability of independent sets and vertex covers under extended reconfiguration rules
This page was built for publication: The Perfect Matching Reconfiguration Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092444)
