Efficient algorithms for wavelength assignment on trees of rings

DOI10.1016/j.dam.2008.04.021zbMath1187.68019OpenAlexW2076258407MaRDI QIDQ1028409

Xiao Zhou, Qian-Ping Gu, Zhengbing Bian

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.04.021

zbMATH Keywords

communication networksapproximation algorithmspath coloringwavelength assignmenttrees of rings

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Forwarding and optical indices of 4-regular circulant networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient routing in all-optical networks
• On the $1.1$ Edge-Coloring of Multigraphs
• The Complexity of Coloring Circular Arcs and Chords
• Coloring a Family of Circular Arcs
• A 2-approximation algorithm for path coloring on a restricted class of trees of rings
• Coloring all directed paths in a symmetric tree, with an application to optical networks
• A Theorem on Coloring the Lines of a Network
• The complexity of path coloring and call scheduling
• Sparse and limited wavelength conversion in all-optical tree networks

This page was built for publication: Efficient algorithms for wavelength assignment on trees of rings