Sciweavers

2283 search results - page 193 / 457
» Bounds of Graph Characteristics
Sort
View
IM
2007
13 years 8 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 6 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
RSA
2011
126views more  RSA 2011»
13 years 3 months ago
Local resilience of almost spanning trees in random graphs
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...
József Balogh, Béla Csaba, Wojciech ...
SIAMDM
2010
89views more  SIAMDM 2010»
13 years 3 months ago
Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
Wei-Tian Li, Linyuan Lu, Yiting Yang
GIS
2006
ACM
14 years 9 months ago
On-line maintenance of simplified weighted graphs for efficient distance queries
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
Floris Geerts, Peter Z. Revesz, Jan Van den Bussch...