The following pages link to (Q4606338):
Displaying 13 items.
- Complexity of token swapping and its variants (Q722547) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- (Q5089148) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Improving quantum computation by optimized qubit routing (Q6167090) (← links)
