39 search results - page 4 / 8 » Kernel Bounds for Disjoint Cycles and Disjoint Paths |
SIAMDM
2010
13 years 2 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
TON
2010
13 years 5 months ago
2010
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract—In [1], the author presented a 1+N protection strategy against single link failures using a network coding approach on p-Cycles. In this paper, we extend this approach t...
ESCAPE
2007
Springer
13 years 11 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...