Constrained bipartite edge coloring with applications to wavelength routing

DOI10.1007/3-540-63165-8_205zbMath1401.68251OpenAlexW1915011574MaRDI QIDQ4571980

Erlebach, Thomas, Christos Kaklamanis, Pino Persiano, Klaus Jansen

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_205

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Approximate constrained bipartite edge coloring ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ On-line routing in all-optical networks ⋮ On routing of wavebands for all-to-all communications in all-optical paths and cycles ⋮ The complexity of path coloring and call scheduling ⋮ Edge coloring of bipartite graphs with constraints ⋮ On-line routing in all-optical networks ⋮ Randomized path coloring on binary trees.

Cites Work

• Efficient wavelength routing on directed fiber trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Constrained bipartite edge coloring with applications to wavelength routing