Pages that link to "Item:Q2232599"
From MaRDI portal
The following pages link to On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599):
Displaying 5 items.
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience (Q742417) (← links)
- Disjoint multipath routing using colored trees (Q878738) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- Color-coding algorithms to the balanced path problem: computational issues (Q2899137) (← links)
- Finding Paths between Graph Colourings: Computational Complexity and Possible Distances (Q3503504) (← links)