2 search results - page 1 / 1 » Covering Two-Edge-Coloured Complete Graphs with Two Disjoint... |
94
Voted
CPC
2008
15 years 1 months ago
2008
In 1998 Luczak, R
125
Voted
NETWORKS
2007
15 years 18 days ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...