337 search results - page 6 / 68 » Matching Algorithms Are Fast in Sparse Random Graphs |
SIAMCOMP
2002
13 years 7 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
STOC
2000
ACM
14 years 5 days ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
SODA
1993
ACM
13 years 9 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...