Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,337
Expander Graphs
"... Now that we have seen a variety of basic derandomization techniques, we will move on to study the first major “pseudorandom object” in this survey, expander graphs. These are graphs that are “sparse” yet very “well-connected.” ..."
Abstract
- Add to MetaCart
Now that we have seen a variety of basic derandomization techniques, we will move on to study the first major “pseudorandom object” in this survey, expander graphs. These are graphs that are “sparse” yet very “well-connected.”
Universal traversal sequences for expander graphs
- Information Processing Letters
, 1993
"... connectivity, computational complexity, expander graphs. ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
connectivity, computational complexity, expander graphs.
Short Paths in Expander Graphs
- In Proceedings of the 37th Annual Symposium on Foundations of Computer Science
, 1996
"... Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the inter--connection networks on which they run. We develop new routing algorithms and structural results for bounded--degree expander graphs. Our results are unified by the fact that they ..."
Abstract
-
Cited by 44 (1 self)
- Add to MetaCart
Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the inter--connection networks on which they run. We develop new routing algorithms and structural results for bounded--degree expander graphs. Our results are unified by the fact
Splitting an Expander Graph
"... Let G = (V; E) be an r-regular expander graph. Certain algorithms for finding edge disjoint paths require the edges of G to be partitioned into E = E 1 [ E 2 [ \Delta \Delta \Delta [ E k so that the graphs G i = (V; E i ) are each expanders. In this paper we give a non-constructive proof of a very g ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
Let G = (V; E) be an r-regular expander graph. Certain algorithms for finding edge disjoint paths require the edges of G to be partitioned into E = E 1 [ E 2 [ \Delta \Delta \Delta [ E k so that the graphs G i = (V; E i ) are each expanders. In this paper we give a non-constructive proof of a very
Vertex Percolation on Expander Graphs
, 2008
"... We say that a graph G = (V, E) on n vertices is a β-expander for some constant β> 0 if every U ⊆ V of cardinality |U | ≤ n 2 satisfies |NG(U) | ≥ β|U | where NG(U) denotes the neighborhood of U. In this work we explore the process of deleting vertices of a β-expander independently at random wit ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We say that a graph G = (V, E) on n vertices is a β-expander for some constant β> 0 if every U ⊆ V of cardinality |U | ≤ n 2 satisfies |NG(U) | ≥ β|U | where NG(U) denotes the neighborhood of U. In this work we explore the process of deleting vertices of a β-expander independently at random
Stochastic Construction of Expander Graphs
"... Abstract Expander graphs form a class of combinatorial objects that are used for many important constructions that are of interest in the theory of computation; their widespread applications range from error-correcting codes to pseudorandom number generators and switching networks. Yet until recent ..."
Abstract
- Add to MetaCart
Abstract Expander graphs form a class of combinatorial objects that are used for many important constructions that are of interest in the theory of computation; their widespread applications range from error-correcting codes to pseudorandom number generators and switching networks. Yet until
Basic Facts about Expander Graphs
"... In this survey we review basic facts regarding expander graphs that are most relevant to the theory of computation. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this survey we review basic facts regarding expander graphs that are most relevant to the theory of computation.
Symmetric groups and expander graphs
- Invent. Math
"... We construct explicit generating sets Sn and ˜ Sn of the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), Sn) and C(Sym(n), ˜ Sn) into a family of bounded degree expanders for all n. This answers affirmatively an old question which has been asked many times in the litera ..."
Abstract
-
Cited by 22 (3 self)
- Add to MetaCart
We construct explicit generating sets Sn and ˜ Sn of the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), Sn) and C(Sym(n), ˜ Sn) into a family of bounded degree expanders for all n. This answers affirmatively an old question which has been asked many times
Results 1 - 10
of
1,337
