98 search results - page 1 / 20 » Minimal paths and cycles in set systems |
EJC
2007
14 years 10 months ago
2007
A minimal k-cycle is a family of sets A0, . . . , Ak−1 for which Ai ∩ Aj = ∅ if and only if i = j or i and j are consecutive modulo k. Let fr(n, k) be the maximum size of a ...
TPDS
2010
14 years 9 months ago
2010
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
TPDS
2008
14 years 10 months ago
2008
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
EJC
2008
14 years 9 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
101
click to vote
NETWORKS
2007
14 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...