scientific article; zbMATH DE number 6472619

zbMath1321.68388MaRDI QIDQ5501821

Vijay Kumar, Eric J. Schwabe

Publication date: 14 August 2015

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

Minimizing ADMs on WDM directed fiber trees ⋮ Constrained bipartite edge coloring with applications to wavelength routing ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ 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 ⋮ Edge coloring of bipartite graphs with constraints ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ On-line routing in all-optical networks ⋮ Randomized path coloring on binary trees. ⋮ Minimizing maximum fiber requirement in optical networks

This page was built for publication: