5 search results - page 1 / 1 » Vertex disjoint routings of cycles over tori |
NETWORKS
2007
13 years 10 months 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...
DM
2010
13 years 11 months ago
2010
ICALP
1998
Springer
14 years 3 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
ANTSW
2010
Springer
13 years 9 months ago
2010
Springer
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
CPC
2010
13 years 8 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...