515 search results - page 5 / 103 » Layouts of Expander Graphs |
RANDOM
1998
Springer
14 years 1 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
ECCC
2000
13 years 9 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
MFCS
2007
Springer
14 years 3 months ago
2007
Springer
