The following pages link to Traffic grooming on the path (Q2382667):
Displaying 9 items.
- Directed acyclic graphs with the unique dipath property (Q393144) (← links)
- On the complexity and algorithm of grooming regular traffic in WDM optical networks (Q436806) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- The complexity of the unit stop number problem and its implications to other related problems (Q2136280) (← links)
- A network flow approach for static and dynamic traffic grooming in WDM networks (Q2432682) (← links)
- Traffic grooming in bidirectional WDM ring networks (Q3113504) (← 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)
