The following pages link to (Q5501821):
Displaying 12 items.
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Minimizing ADMs on WDM directed fiber trees (Q1884302) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- Optimal wavelength routing on directed fiber trees (Q1960521) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
- Constrained bipartite edge coloring with applications to wavelength routing (Q4571980) (← links)
- On-line routing in all-optical networks (Q4571982) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
- Edge coloring of bipartite graphs with constraints (Q5958313) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
