Pages that link to "Item:Q4539866"
From MaRDI portal
The following pages link to Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866):
Displaying 8 items.
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Generation of colour-constrained spanning trees with application in symbolic circuit analysis (Q4355497) (← links)
- (Q4453871) (← links)
- Algorithmic Applications in Management (Q5710125) (← links)
- Sparse and limited wavelength conversion in all-optical tree networks (Q5958780) (← links)
