Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs

DOI10.1016/S0012-365X(02)00465-XzbMath1008.05122OpenAlexW2115721429MaRDI QIDQ1861286

Alan C. H. Ling, Charles J. Colbourn

Publication date: 16 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00465-x

zbMATH Keywords

wavelengthsource-destination circuitsynchronous optical network ring

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Grooming in unidirectional rings: \(K_{4}-e\) designs ⋮ Optical grooming with grooming ratio eight ⋮ Traffic grooming in bidirectional WDM ring networks

This page was built for publication: Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs