The following pages link to Routing and path multicoloring (Q1607124):
Displaying 16 items.
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Routing and wavelength assignment by partition colouring (Q819072) (← links)
- Satisfying a maximum number of pre-routed requests in all-optical rings. (Q1400411) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- Path multicoloring in spider graphs with even color multiplicity (Q1705690) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- Stathis Zachos at 70! (Q5283390) (← links)
- STACS 2004 (Q5309688) (← links)
- STACS 2004 (Q5309705) (← links)
- Algorithms - ESA 2003 (Q5897231) (← links)