11381 search results - page 21 / 2277 » Connectivity |
SIAMDM
2000
14 years 9 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
ICDCSW
2006
IEEE
15 years 3 months ago
2006
IEEE
The extent to which a wireless multi-hop network is connected is usually measured by the probability that all the nodes form a single connected component. We find this measure, c...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—This paper describes a mechanism allowing nodes to hand-off active connections by utilizing connection splicing at an edge-switch serving as a gateway to a server cluster. The m...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
117
click to vote
SP
1997
IEEE
15 years 1 months ago
1997
IEEE
Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and tra c a...