Efficient algorithms for wavelength assignment on trees of rings
From MaRDI portal
Publication:1028409
DOI10.1016/J.DAM.2008.04.021zbMATH Open1187.68019OpenAlexW2076258407MaRDI QIDQ1028409FDOQ1028409
Authors: Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
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
Recommendations
- Wavelength allocation on trees of rings
- Wavelength assignment algorithms on trees on rings under different communication models
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- A memetic algorithm to schedule planned maintenance for the national grid
- scientific article; zbMATH DE number 1163711
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
- scientific article; zbMATH DE number 1787332
- scientific article; zbMATH DE number 1834661
- Approximation algorithms for constructing wavelength routing networks
- Optimal capacitated ring trees
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- The Complexity of Coloring Circular Arcs and Chords
- Title not available (Why is that?)
- The complexity of path coloring and call scheduling
- On the $1.1$ Edge-Coloring of Multigraphs
- A Theorem on Coloring the Lines of a Network
- Coloring a Family of Circular Arcs
- Efficient routing in all-optical networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sparse and limited wavelength conversion in all-optical tree networks
- A 2-approximation algorithm for path coloring on a restricted class of trees of rings
- Title not available (Why is that?)
- Coloring all directed paths in a symmetric tree, with an application to optical networks
Cited In (9)
- Forwarding and optical indices of 4-regular circulant networks
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Title not available (Why is that?)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
- Wavelength allocation on trees of rings
- A note on optical routing on trees
- Wavelength assignment algorithms on trees on rings under different communication models
- A memetic algorithm to schedule planned maintenance for the national grid
- Title not available (Why is that?)
This page was built for publication: Efficient algorithms for wavelength assignment on trees of rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028409)