On mRJ reachability in trees
From MaRDI portal
Publication:4903641
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
Cited in
(3)
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)