The following pages link to Swapping labeled tokens on graphs (Q2347003):
Displaying 24 items.
- Complexity of token swapping and its variants (Q722547) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- The packing number of the double vertex graph of the path graph (Q1671357) (← links)
- Swapping colored tokens on graphs (Q1749531) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- The connectivity of token graphs (Q2413643) (← links)
- Token shifting on graphs (Q2695335) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q2980931) (← links)
- Swapping Colored Tokens on Graphs (Q3449858) (← 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)
- Hamiltonicity of token graphs of fan graphs (Q5198012) (← links)
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations (Q5228057) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- On the Connectivity of Token Graphs of Trees (Q6045414) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Improving quantum computation by optimized qubit routing (Q6167090) (← links)
