3958 search results - page 21 / 792 » Dynamic Graph Algorithms with Applications |
127
Voted
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
170
click to vote
WAW
2010
Springer
15 years 8 days ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
121
click to vote
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
114
click to vote
SPAA
2009
ACM
15 years 9 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
130
click to vote
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...