论文信息 - On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements - 字舞流文

On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements

Thomas Erlebach | Stamatis Stefanakos | T. Erlebach | Stamatis Stefanakos

[1] Thomas Erlebach,et al. Wavelength conversion in networks of bounded treewidth , 2002 .

[2] Ioannis Caragiannis,et al. Sparse and limited wavelength conversion in all-optical tree networks , 2001, Theor. Comput. Sci..

[3] Klaus Jansen,et al. The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..

[4] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[5] Klaus Jansen,et al. Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[6] Amit Kumar,et al. Wavelength conversion in optical networks , 1999, SODA '99.

[7] Vijay Kumar,et al. Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks , 1998, APPROX.

[8] Luisa Gargano,et al. Limited Wavelength Conversion in All-Optical Tree Networks , 1998, ICALP.

[9] Peter Winkler,et al. Ring routing and wavelength translation , 1998, SODA '98.

[10] Yuval Rabani,et al. Path coloring on the mesh , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[11] Gary L. Miller,et al. The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[12] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .