Superconcentrators of depths 2 and 3; odd levels help (rarely)

Noga Mordechai Alon, Pavel Pudlak

Research output: Contribution to journalArticle

16 Scopus citations

Abstract

It is shown that the minimum possible number of edges in an n-superconcentrator of depth 3 is Θ(n log log n), whereas the minimum possible number of edges in an n-superconcentrator of depth 2 is Ω(n(log n)3/2) (and is O(n(log n)2)).

Original languageEnglish (US)
Pages (from-to)194-202
Number of pages9
JournalJournal of Computer and System Sciences
Volume48
Issue number1
DOIs
StatePublished - Jan 1 1994
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Superconcentrators of depths 2 and 3; odd levels help (rarely)'. Together they form a unique fingerprint.

  • Cite this