Pages that link to "Item:Q1960521"
From MaRDI portal
The following pages link to Optimal wavelength routing on directed fiber trees (Q1960521):
Displaying 16 items.
- Parameterized maximum path coloring (Q392021) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- Minimizing ADMs on WDM directed fiber trees (Q1884302) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- Selfish Routing and Path Coloring in All-Optical Networks (Q5458507) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)
