Multi-color pebble motion on graphs (Q1957647): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Modern Treatment of the 15 Puzzle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal pebble motion on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the feasibility of pebble motion on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconfigurations in Graphs and Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushing squares around / 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: An algorithm for two-dimensional rigidity percolation: The pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Graph Pebbling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A real-time algorithm for the \((n^{2}-1)\)-puzzle / 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

Latest revision as of 06:01, 3 July 2024

scientific article
Language Label Description Also known as
English
Multi-color pebble motion on graphs
scientific article

    Statements

    Identifiers