Wavelength routing in optical networks of diameter two

DOI10.1016/S0377-0427(01)00463-0zbMath1005.68114OpenAlexW2038582161MaRDI QIDQ1612298

Christopher Jagger, Andrew G. Thomason

Publication date: 22 August 2002

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(01)00463-0

zbMATH Keywords

wavelength routingoptical networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Ramanujan graphs
• Efficient routing in all-optical networks
• Edge Separators of Planar and Outerplanar Graphs With Applications
• A new series of dense graphs of high girth
• Quasi-random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Wavelength routing in optical networks of diameter two