Pages that link to "Item:Q435732"
From MaRDI portal
The following pages link to On the maximum disjoint paths problem on edge-colored graphs (Q435732):
Displayed 5 items.
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)