Swapping labeled tokens on graphs
From MaRDI portal
Publication:2347003
Recommendations
- Swapping colored tokens on graphs
- Swapping Colored Tokens on Graphs
- Sequentially swapping tokens: further on graph classes
- Sequentially swapping colored tokens on graphs
- Sequentially swapping colored tokens on graphs
- Token shifting on graphs
- Token Swapping on Trees
- Token sliding on split graphs
- Token sliding on split graphs
Cites work
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- Axioms and hulls
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- Efficient enumeration of all ladder lotteries and its application
- scientific article; zbMATH DE number 3938577 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Sorting on a mesh-connected parallel computer
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- The complexity of finding minimum-length generator sequences
- Tree Spanners
Cited in
(38)- A simple proof that the \((n^{2} - 1)\)-puzzle is hard
- The packing number of the double vertex graph of the path graph
- Swapping colored tokens on graphs
- The edge-connectivity of token graphs
- Introduction to reconfiguration
- Sorting on graphs by adjacent swaps using permutation groups
- How to sort by walking and swapping on paths and trees
- The connectivity of token graphs
- Token shifting on graphs
- Sequentially swapping colored tokens on graphs
- Swapping Colored Tokens on Graphs
- Approximation and hardness of token swapping
- Sequentially swapping colored tokens on graphs
- The time complexity of permutation routing via matching, token swapping and a variant
- Shortest reconfiguration of perfect matchings via alternating cycles
- Connecting the dots (with minimum crossings)
- scientific article; zbMATH DE number 7559364 (Why is no real title available?)
- Hamiltonicity of token graphs of fan graphs
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
- Geometry and generation of a new graph planarity game
- Reconfigurations in Graphs and Grids
- On the Connectivity of Token Graphs of Trees
- Token Swapping on Trees
- Reconfiguration of connected graph partitions
- Improving quantum computation by optimized qubit routing
- Sequentially swapping tokens: further on graph classes
- Algorithmic theory of qubit routing
- On the diameters of friends-and-strangers graphs
- Gap preserving reductions between reconfiguration problems
- Complexity of action path finding with small precondition sets
- On the automorphism group of token graphs of complete bipartite graphs
- Parallel token swapping for qubit routing
- Hardness of token swapping on trees
- Friends-and-strangers is \textsf{PSPACE}-complete
- Complexity of token swapping and its variants
- Coordinated motion planning: multi-agent path finding in a densely packed, bounded domain
- Improved hardness-of-approximation for token-swapping
- Coloring reconfiguration under color swapping
This page was built for publication: Swapping labeled tokens on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2347003)
