Pages that link to "Item:Q1283933"
From MaRDI portal
The following pages link to A linear-time algorithm for the feasibility of pebble motion on trees (Q1283933):
Displaying 15 items.
- Colored pebble motion on graphs (Q412280) (← links)
- Token graphs (Q1926040) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- Pebble exchange group of graphs (Q2033933) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Efficient generation of performance bounds for a class of traffic scheduling problems (Q2286334) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Pebble exchange on graphs (Q2341759) (← links)
- The connectivity of token graphs (Q2413643) (← links)
- Polynomial-time optimal liveness enforcement for guidepath-based transport systems (Q2665316) (← links)
- On reachability in graphs with obstacles (Q2788738) (← links)
- Independence and matching numbers of some token graphs (Q5109075) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- On the 2-Token Graphs of Some Disjoint Union of Graphs (Q6123833) (← links)
