A network flow approach for static and dynamic traffic grooming in WDM networks (Q2432682)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5067491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A network flow approach for static and dynamic traffic grooming in WDM networks |
scientific article; zbMATH DE number 5067491 |
Statements
A network flow approach for static and dynamic traffic grooming in WDM networks (English)
0 references
25 October 2006
0 references
network flow approach
0 references
traffic grooming
0 references
graph transformation
0 references
minimum edge-cost flow problem
0 references
0.8331668972969055
0 references
0.8311747908592224
0 references
0.8311331868171692
0 references
0.8187758922576904
0 references
0.8179711103439331
0 references
