Routing and path multicoloring
From MaRDI portal
Publication:1607124
DOI10.1016/S0020-0190(01)00167-3zbMATH Open1003.68005OpenAlexW2022347159MaRDI QIDQ1607124FDOQ1607124
Stathis Zachos, Christos Nomikos, Aris Pagourtzis
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00167-3
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition by clique separators
- The NP-Completeness of Edge-Coloring
- The Complexity of Coloring Circular Arcs and Chords
- A better than “best possible” algorithm to edge color multigraphs
- On Edge Coloring Bipartite Graphs
- Bipartite Edge Coloring in $O(\Delta m)$ Time
- An optimal greedy heuristic to color interval graphs
- Optimal wavelength routing on directed fiber trees
- Efficient routing in all-optical networks
Cited In (9)
- Path multicoloring with fewer colors in spiders and caterpillars
- Wavelength assignment in multifiber star networks
- Stathis Zachos at 70!
- Minimum multiplicity edge coloring via orientation
- Routing multiple paths in hypercubes
- STACS 2004
- Minimizing maximum fiber requirement in optical networks
- Path multicoloring in spider graphs with even color multiplicity
- Multicolor routing in the undirected hypercube
This page was built for publication: Routing and path multicoloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607124)
