Sequentially Swapping Colored Tokens on Graphs (Q4622769): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4800031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of token swapping and its variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit lower bound for TSP with distances one and two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time Complexity of the Token Swapping Problem and Its Parallel Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \((n^ 2-1)\)-puzzle and related relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph puzzles, homotopy, and the alternating group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping labeled tokens on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swapping Colored Tokens on Graphs / rank
 
Normal rank

Revision as of 04:17, 18 July 2024

scientific article; zbMATH DE number 7021728
Language Label Description Also known as
English
Sequentially Swapping Colored Tokens on Graphs
scientific article; zbMATH DE number 7021728

    Statements

    Sequentially Swapping Colored Tokens on Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    puzzles on graphs
    0 references
    sequential token swapping problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references