ON mRJ REACHABILITY IN TREES

DOI10.1142/S1793830912500553zbMath1282.91067OpenAlexW2132884155MaRDI QIDQ4903641

Kalpesh Kapoor, Biswajit Deb, Sukanta Pati

Publication date: 24 January 2013

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830912500553

zbMATH Keywords

reachabilitydiameterstarlike trees\(m\)RJ-moves

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On Complete S-Reachable Graphs ⋮ A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles ⋮ Motion planning in Cartesian product graphs

Cites Work

• Feasibility of motion planning on acyclic and strongly connected directed graphs
• The \((n^ 2-1)\)-puzzle and related relocation problems
• Searching and pebbling
• Modelling and solving English peg solitaire

This page was built for publication: ON mRJ REACHABILITY IN TREES