Abstract
In this paper, we will consider the problem of coloring directed paths on a mesh network. A natural application of this graph problem is WDM-routing in all-optical networks. Our main result is a simple 4-approximation algorithm for coloring line-column paths on a mesh. We also present sharper results when there is a restriction on the path lengths. Moreover, we show that these results can be extended to toroidal meshes and to line-column or column-line paths. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Kchikech, M., & Togni, O. (2003). Paths coloring algorithms in mesh networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2731, 193–202. https://doi.org/10.1007/3-540-45066-1_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
