The following pages link to A note on optical routing on trees (Q287098):
Displaying 13 items.
- Parameterized maximum path coloring (Q392021) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← 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)
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
- Improved algorithms for scheduling unsplittable flows on paths (Q2684488) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- Optical Routing of Uniform Instances in Cayley Graphs (Q3438997) (← links)
- An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks (Q4210085) (← links)
- Efficient wavelength routing on directed fiber trees (Q4595507) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
