A linear time algorithm for the feasibility of pebble motion on trees

DOI10.1007/3-540-61422-2_137zbMath1502.68196OpenAlexW1833735476MaRDI QIDQ5054818

Angelo Monti, Pino Persiano, Vincenzo Auletta

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_137

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (2)

Feasibility of motion planning on acyclic and strongly connected directed graphs ⋮ Optimal pebble motion on a tree

Cites Work

• The \((n^ 2-1)\)-puzzle and related relocation problems
• Graph puzzles, homotopy, and the alternating group

This page was built for publication: A linear time algorithm for the feasibility of pebble motion on trees