Pages that link to "Item:Q1741493"
From MaRDI portal
The following pages link to The complexity of routing with collision avoidance (Q1741493):
Displaying 7 items.
- Collision-Free Routing problem with Restricted L-Path (Q1670977) (← links)
- The complexity of routing with few collisions (Q1679978) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- On the approximability of time disjoint walks (Q5918517) (← links)
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs (Q6087215) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)