1729 search results - page 159 / 346 » On Bounds for the k-Partitioning of Graphs |
153
click to vote
TCS
2008
15 years 6 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
167
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
167
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
158
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...