Pages that link to "Item:Q1631683"
From MaRDI portal
The following pages link to Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683):
Displaying 10 items.
- On the maximum disjoint paths problem on edge-colored graphs (Q435732) (← links)
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience (Q742417) (← 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)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← 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)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- On \(s\)--\(t\) paths and trails in edge-colored graphs (Q2840541) (← links)
- (Q2958308) (redirect page) (← links)