163 search results - page 8 / 33 » Fast Edge-Routing for Large Graphs |
SIAMCOMP
2010
13 years 3 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
INFOVIS
2002
IEEE
14 years 1 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
PAKDD
2010
ACM
14 years 1 months ago
2010
ACM
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...
VALUETOOLS
2006
ACM
14 years 2 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
SDM
2011
SIAM
12 years 11 months ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...