4865 search results - page 909 / 973 » The Complexity of Graph Connectivity |
136
Voted
ISPA
2005
Springer
15 years 9 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
157
Voted
ALGORITHMICA
2011
14 years 10 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
153
Voted
PODC
2009
ACM
16 years 4 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
151
Voted
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
123
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...