4865 search results - page 210 / 973 » The Complexity of Graph Connectivity |
118
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
128
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
165
click to vote
TON
2002
15 years 3 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
166
click to vote
SEFM
2008
IEEE
15 years 10 months ago
2008
IEEE
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad ho...
134
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...