1542 search results - page 109 / 309 » The metamathematics of random graphs |
158
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
159
click to vote
SPAA
1992
ACM
15 years 10 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
140
click to vote
SIGMETRICS
2004
ACM
15 years 12 months ago
2004
ACM
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
184
click to vote
ALGORITHMICA
2008
15 years 6 months ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
169
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...