214 search results - page 1 / 43 » Note on Sparse Random Graphs and Cover Graphs |
COMBINATORICS
2000
13 years 4 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
SODA
2003
ACM
13 years 6 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
CPC
2006
13 years 4 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
EJC
2008
13 years 4 months ago
2008
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...