On mRJ reachability in trees

DOI10.1142/S1793830912500553MaRDI QIDQ4903641zbMATH OpenOpenAlexFDO

Authors Biswajit Deb, Kalpesh Kapoor, S. 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

diameterreachabilitystarlike trees\(m\)RJ-moves

Mathematics Subject Classification ID

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

Recommendations

• A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles
• On reachability in graphs with obstacles
• A new approach to optimal planning of robot motion on a tree with obstacles
• A linear-time algorithm for the feasibility of pebble motion on trees
• Motion planning in Cartesian product graphs

Cites work

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

Cited in

(3)

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

This page was built for publication: On \(m\)RJ reachability in trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903641)