Pages that link to "Item:Q4571980"
From MaRDI portal
The following pages link to Constrained bipartite edge coloring with applications to wavelength routing (Q4571980):
Displaying 8 items.
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- On-line routing in all-optical networks (Q1960517) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← 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)