Pages that link to "Item:Q511728"
From MaRDI portal
The following pages link to Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728):
Displaying 9 items.
- Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience (Q742417) (← links)
- On the tractability of shortest path problems in weighted edge-coloured graphs (Q1621167) (← links)
- Finding disjoint paths on edge-colored graphs: more tractability results (Q1631683) (← links)
- Path multicoloring in spider graphs with even color multiplicity (Q1705690) (← links)
- An exact reduction technique for the k-colour shortest path problem (Q2108122) (← links)
- A temporal logic programming approach to planning (Q2424818) (← links)
- (Q2934675) (← links)
- (Q3105838) (← links)
- Valid inequalities for the \(k\)-color shortest path problem (Q6554645) (← links)