721 search results - page 37 / 145 » Almost universal graphs |
171
Voted
IM
2007
15 years 7 months ago
2007
We examine the relationship of a graph G and its random subgraphs which are defined by independently choosing each edge with probability p. Suppose that G has a spectral gap λ (...
198
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
346
click to vote
COMBINATORICA
2011
14 years 7 months ago
2011
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
198
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
219
click to vote
CAV
1998
Springer
15 years 11 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...