Pages that link to "Item:Q4595507"

The following pages link to Efficient wavelength routing on directed fiber trees (Q4595507):

Displaying 21 items.

• A note on optical routing on trees (Q287098) (← links)
• Efficient collective communciation in optical networks (Q1575944) (← links)
• 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)
• The undirected optical indices of complete \(m\)-ary trees (Q2197416) (← links)
• A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
• Equilibrium analysis for anycast in WDM networks (Q3367419) (← links)
• Wavelength allocation on trees of rings (Q4506264) (← links)
• Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
• Constrained bipartite edge coloring with applications to wavelength routing (Q4571980) (← links)
• Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
• On-line routing in all-optical networks (Q4571982) (← links)
• (Q4791663) (← links)
• A memetic algorithm to schedule planned maintenance for the national grid (Q5463389) (← links)
• Graph-Theoretic Concepts in Computer Science (Q5902523) (← 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)