Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
From MaRDI portal
Publication:2714912
DOI<107::AID-NET6>3.0.CO;2-A 10.1002/1097-0037(200103)37:2<107::AID-NET6>3.0.CO;2-AzbMath0967.90010OpenAlexW1963864788MaRDI QIDQ2714912
Peng-Jun Wan, Charles J. Colbourn
Publication date: 20 June 2001
Full work available at URL: https://doi.org/10.1002/1097-0037(200103)37:2<107::aid-net6>3.0.co;2-a
Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)
Related Items (10)
Grooming in unidirectional rings: \(K_{4}-e\) designs ⋮ On the non-existence of pair covering designs with at least as many points as blocks ⋮ A survey on the existence ofG-Designs ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Optical grooming with grooming ratio eight ⋮ A decomposition of (λK υ)+ with extended triangles ⋮ Traffic grooming in bidirectional WDM ring networks ⋮ Graph designs for the eight-edge five-vertex graphs ⋮ A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks ⋮ Degree- and Orbit-Balanced Γ-Designs When Γ Has Five Vertices
Cites Work
This page was built for publication: Minimizing drop cost for SONET/WDM networks with ? wavelength requirements
