Pages that link to "Item:Q436806"
From MaRDI portal
The following pages link to On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806):
Displaying 4 items.
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- A global approach for designing reliable WDM networks and grooming the traffic (Q925825) (← links)
- A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks (Q5256676) (← links)
- Structural Information and Communication Complexity (Q5710095) (← links)