66 search results - page 7 / 14 » Theoretic study of distributed graph planning |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
CASCON
1992
13 years 7 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
SIGMETRICS
2012
ACM
11 years 9 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
—Games built on Online Social Networks (OSNs) have become a phenomenon since 3rd party developer tools were exposed by OSNs such as Facebook. However, apart from their explosive ...