Routing and path multicoloring

DOI10.1016/S0020-0190(01)00167-3zbMath1003.68005OpenAlexW2022347159MaRDI QIDQ1607124

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

zbMATH Keywords

optical networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (6)

Stathis Zachos at 70! ⋮ Minimum multiplicity edge coloring via orientation ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ Path multicoloring with fewer colors in spiders and caterpillars ⋮ Wavelength assignment in multifiber star networks ⋮ Minimizing maximum fiber requirement in optical networks

Cites Work

• An optimal greedy heuristic to color interval graphs
• Decomposition by clique separators
• Optimal wavelength routing on directed fiber trees
• Efficient routing in all-optical networks
• A better than “best possible” algorithm to edge color multigraphs
• The NP-Completeness of Edge-Coloring
• On Edge Coloring Bipartite Graphs
• The Complexity of Coloring Circular Arcs and Chords
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Routing and path multicoloring