5606 search results - page 2 / 1122 » Randomization Techniques for Graphs. |
IPPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
CPC
2006
13 years 5 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
RSA
2011
13 years 3 days ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
APPROX
2008
Springer
13 years 7 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...
RSA
2008
13 years 4 months ago
2008
Let I be a random 3CNF formula generated by choosing a truth assignment for variables x1, . . . , xn uniformly at random and including every clause with i literals set true by w...