Routing and path multicoloring

DOI10.1016/S0020-0190(01)00167-3zbMATH Open1003.68005OpenAlexW2022347159MaRDI QIDQ1607124FDOQ1607124

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

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

zbMATH Keywords

optical networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Path multicoloring with fewer colors in spiders and caterpillars
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• The complexity of path coloring and call scheduling
• Wavelength assignment in multifiber star networks
• Routing and wavelength assignment by partition colouring
• A 2-approximation algorithm for path coloring on a restricted class of trees of rings
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Minimizing maximum fiber requirement in optical networks
• On non-superperfection of edge intersection graphs of paths
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
• Path multicoloring in spider graphs with even color multiplicity
• Line system design and a generalized coloring problem
• Multicolor routing in the undirected hypercube
• STACS 2004

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)