scientific article; zbMATH DE number 1306887

zbMath0938.68522MaRDI QIDQ4252739

No author found.

Publication date: 26 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (24)

Approximate constrained bipartite edge coloring ⋮ Coloring all directed paths in a symmetric tree, with an application to optical networks ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ Scheduling multicasts on unit-capacity trees and meshes. ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Batch Coloring Flat Graphs and Thin ⋮ A Refined Analysis of Online Path Coloring in Trees ⋮ On-line routing in all-optical networks ⋮ Optimal wavelength routing on directed fiber trees ⋮ The complexity of path coloring and call scheduling ⋮ 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings ⋮ Short length Menger's theorem and reliable optical routing ⋮ Wavelength assignment in multifiber star networks ⋮ Edge coloring of bipartite graphs with constraints ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Wavelength routing of uniform instances in all-optical rings ⋮ Efficient algorithms for wavelength assignment on trees of rings ⋮ Efficient collective communciation in optical networks ⋮ On-line routing in all-optical networks ⋮ Randomized path coloring on binary trees. ⋮ Minimizing maximum fiber requirement in optical networks ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ Routing and path multicoloring

This page was built for publication: