Pages that link to "Item:Q708329"
From MaRDI portal
The following pages link to Feasibility of motion planning on acyclic and strongly connected directed graphs (Q708329):
Displaying 9 items.
- Backtracking problem in the traversal of an unknown directed graph by a finite robot (Q1774308) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (Q2413355) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- ON <i>mRJ</i> REACHABILITY IN TREES (Q4903641) (← links)
- Minimum 2-vertex strongly biconnected spanning directed subgraph problem (Q5051435) (← links)
- On Complete S-Reachable Graphs (Q5069738) (← links)
- The computational complexity of multi-agent pathfinding on directed graphs (Q6494349) (← links)
- Constrained motion planning and multi-agent path finding on directed graphs (Q6566732) (← links)