335 search results - page 4 / 67 » How to Use Spanning Trees to Navigate in Graphs |
SODA
2007
ACM
13 years 11 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
SRDS
1998
IEEE
14 years 2 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
SIAMDM
2010
13 years 4 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
EGH
2009
Springer
13 years 7 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
RSA
2011
13 years 4 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...