Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs

DOI10.1007/11751588_89zbMath1170.68329OpenAlexW1555918839MaRDI QIDQ3599036

Min Young Chung, Duk Hun Kim, Hyunseung Choo, Won Jin Yoon, Tae-Jin 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)

Related Items (1)

Solving routing and wavelength assignment problem with maximum edge-disjoint paths

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