Pages that link to "Item:Q1736537"
From MaRDI portal
The following pages link to Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537):
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)
- Editorial: Special issue on graph algorithms (Q1736576) (← links)
- Finding colorful paths in temporal graphs (Q2086641) (← links)
- On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)