The following pages link to (Q3128902):
Displaying 14 items.
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Efficient delay routing (Q1128715) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Optimal wavelength routing on directed fiber trees (Q1960521) (← links)
- Multicolor routing in the undirected hypercube (Q1971219) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- Minimizing wavelengths in an all-optical ring network (Q6487454) (← links)
