Pages that link to "Item:Q5941061"
From MaRDI portal
The following pages link to The complexity of path coloring and call scheduling (Q5941061):
Displayed 10 items.
- Short length Menger's theorem and reliable optical routing (Q557907) (← links)
- Routing and wavelength assignment by partition colouring (Q819072) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- Nash equilibria in all-optical networks (Q1043952) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)