Grooming in unidirectional rings: \(K_{4}-e\) designs
From MaRDI portal
Publication:1876673
DOI10.1016/j.disc.2003.11.023zbMath1061.90017OpenAlexW2008497326MaRDI QIDQ1876673
Charles J. Colbourn, Min-Li Yu, Alan C. H. Ling, Jean-Claude Bermond
Publication date: 20 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.023
Related Items (12)
Traffic grooming on the path ⋮ Optimal Groomings with Grooming Ratios Six and Seven ⋮ Optical grooming with grooming ratio nine ⋮ Grooming traffic to minimize load ⋮ Lower bounds for two-period grooming via linear programming duality ⋮ Grooming for two-period optical networks ⋮ Optical grooming with grooming ratio eight ⋮ Two types of switchable \(\lambda \)-fold \((K_4 - e)\)-designs ⋮ An existence theory for loopy graph decompositions ⋮ Traffic grooming in bidirectional WDM ring networks ⋮ Embedding path designs into kite systems ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
- Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
- Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
- Minimum embedding of P3-designs into (K4?e)-designs
- The SONET edge‐partition problem
- Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3
This page was built for publication: Grooming in unidirectional rings: \(K_{4}-e\) designs
