The following pages link to Optimal pebble motion on a tree (Q1854411):
Displaying 9 items.
- Feasibility of motion planning on acyclic and strongly connected directed graphs (Q708329) (← links)
- A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- Efficient algorithms for the 2-gathering problem (Q2930311) (← links)
- Motions of a connected subgraph representing a swarm of robots inside a graph of work stations (Q5054048) (← links)
- A linear time algorithm for the feasibility of pebble motion on trees (Q5054818) (← links)
- On Complete S-Reachable Graphs (Q5069738) (← links)
- Token Swapping on Trees (Q6045462) (← links)