62 search results - page 2 / 13 » Generating Random Graphs with Large Girth |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
WAW
2004
Springer
13 years 10 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
ISCA
2012
IEEE
11 years 7 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...