Sequentially Swapping Colored Tokens on Graphs (Q2980931): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4827118 / 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: Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard / 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: 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 |
Latest revision as of 18:14, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sequentially Swapping Colored Tokens on Graphs |
scientific article |
Statements
Sequentially Swapping Colored Tokens on Graphs (English)
0 references
5 May 2017
0 references