Sciweavers

Share
5 search results - page 1 / 1
» Vertex disjoint routings of cycles over tori
Sort
View
NETWORKS
2007
11 years 7 months ago
Vertex disjoint routings of cycles over tori
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...
Jean-Claude Bermond, Min-Li Yu
DM
2010
103views more  DM 2010»
11 years 8 months ago
Packing disjoint cycles over vertex cuts
Jochen Harant, Dieter Rautenbach, Peter Recht, Ing...
ICALP
1998
Springer
12 years 9 days ago
Static and Dynamic Low-Congested Interval Routing Schemes
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...
Serafino Cicerone, Gabriele Di Stefano, Michele Fl...
ANTSW
2010
Springer
11 years 6 months ago
Autonomous Multi-agent Cycle Based Patrolling
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...
Yotam Elor, Alfred M. Bruckstein
CPC
2010
117views more  CPC 2010»
11 years 5 months ago
On the Number of Perfect Matchings in Random Lifts
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)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
books