Optimal pebble motion on a tree

DOI10.1006/inco.2000.3005zbMath1003.68195OpenAlexW1965454152MaRDI QIDQ1854411

Pino Persiano, Vincenzo Auletta

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.3005

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Motions of a connected subgraph representing a swarm of robots inside a graph of work stations ⋮ On Complete S-Reachable Graphs ⋮ Token Swapping on Trees ⋮ Multi-color pebble motion on graphs ⋮ Feasibility of motion planning on acyclic and strongly connected directed graphs ⋮ On reachability in graphs with obstacles

Cites Work

• Graph puzzles, homotopy, and the alternating group
• A linear time algorithm for the feasibility of pebble motion on trees

This page was built for publication: Optimal pebble motion on a tree