Routing and path multicoloring

DOI10.1016/S0020-0190(01)00167-3MaRDI QIDQ1607124zbMATH OpenOpenAlexFDO

Authors Christos Nomikos, Aris Pagourtzis, Stathis Zachos

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)

Recommendations

• STACS 2004
• scientific article; zbMATH DE number 1984545
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Optimal wavelength-routed multicasting
• Path multicoloring with fewer colors in spiders and caterpillars

Cites work

• scientific article; zbMATH DE number 1670869 (Why is no real title available?)
• scientific article; zbMATH DE number 3706474 (Why is no real title available?)
• scientific article; zbMATH DE number 1306887 (Why is no real title available?)
• A better than “best possible” algorithm to edge color multigraphs
• An optimal greedy heuristic to color interval graphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Decomposition by clique separators
• Efficient routing in all-optical networks
• On Edge Coloring Bipartite Graphs
• Optimal wavelength routing on directed fiber trees
• The Complexity of Coloring Circular Arcs and Chords
• The NP-Completeness of Edge-Coloring

Cited in

(22)

• STACS 2004
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Path multicoloring with fewer colors in spiders and caterpillars
• Routing and wavelength assignment by partition colouring
• Wavelength assignment in multifiber star networks
• The complexity of path coloring and call scheduling
• A 2-approximation algorithm for path coloring on a restricted class of trees of rings
• scientific article; zbMATH DE number 2040950 (Why is no real title available?)
• scientific article; zbMATH DE number 1984545 (Why is no real title available?)
• Stathis Zachos at 70!
• Path problems in generalized stars, complete graphs, and brick wall graphs
• Minimum multiplicity edge coloring via orientation
• Routing multiple paths in hypercubes
• STACS 2004
• On superperfection of edge intersection graphs of paths
• scientific article; zbMATH DE number 1839474 (Why is no real title available?)
• Minimizing maximum fiber requirement in optical networks
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
• On non-superperfection of edge intersection graphs of paths
• Path multicoloring in spider graphs with even color multiplicity
• Multicolor routing in the undirected hypercube
• Line system design and a generalized coloring problem

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)