Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs

DOI10.1007/11751588_89MaRDI QIDQ3599036zbMATH OpenOpenAlexFDO

Authors Won Jin Yoon, Duk Hun Kim, Min Young Chung, Hyunseung Choo, Taejin Lee

Publication date 3 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.9028

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• scientific article; zbMATH DE number 2030041
• A Simple and Efficient RWA Algorithm Based on Priority of Edge Disjoint Paths
• scientific article; zbMATH DE number 2088479
• STACS 2004

Cited in

(3)

• Solving routing and wavelength assignment problem with maximum edge-disjoint paths
• A Simple and Efficient RWA Algorithm Based on Priority of Edge Disjoint Paths
• 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings

This page was built for publication: Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599036)