Limitations on Explicit Constructions of Expanding Graphs

@article{Klawe1984LimitationsOE,
  title={Limitations on Explicit Constructions of Expanding Graphs},
  author={Maria M. Klawe},
  journal={SIAM J. Comput.},
  year={1984},
  volume={13},
  pages={156-166}
}
Expanding graphs are the basic building blocks in constructions of many types of graphs with special connectivity properties which arise in a variety of applications including switching networks, sorting networks and establishing time-space trade-offs for numerous computational problems. Only one explicit method of constructing arbitrarily large expanding graphs with a linear number of edges is known (Margulis [13], Gabber and Galil [8]), but the number of edges used is much greater than the… CONTINUE READING

From This Paper

Topics from this paper.
17 Citations
22 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 22 references

GALIL, Explicit constructions of linear size superconcentrators

  • Z. O. GABBER
  • Proc. 20th Annual Symposium on the Foundations…
  • 1979
Highly Influential
6 Excerpts

Explicit concentrators from generalized N-gons

  • R. M. TANNER
  • SIAM J. Alg. Discr. Meth.,
  • 1984
2 Excerpts

KOMLOS AND E. SZEMEREDI, An O(n log n) sorting network

  • J. M. AJTAI
  • Proc. 15th Annual ACM Symposium on the Theory of…
  • 1983
2 Excerpts

REISCHUK, On Alternation IIma graph theoretic approach to determinism versus nondeterminism

  • R. W. PAUL
  • Acta Inform.,
  • 1980

TARJAN AND J. CELONI, Space bounds for a game on graphs, Math

  • R. W. PAUL
  • Systems Theory,
  • 1979
1 Excerpt

Similar Papers

Loading similar papers…