Abstract
Superconcentration is a strong property of interconnection diagraphs. We characterize its negation by existence of two disjoint and seperated sets which shrink under the forward and backward neighbor relation, respectively. This enables a better, non-cascaded design of superconcentrators, explicit ones with edge density ≤ 118, random ones with edge density ≤ 13.
Original language | English |
---|---|
Title of host publication | STACS 1984 - Symposium of Theoretical Aspects of Computer Science |
Editors | K. Mehlhorn, M. Fontet |
Publisher | Springer Verlag |
Pages | 121-128 |
Number of pages | 8 |
ISBN (Print) | 9783540129202 |
DOIs | |
State | Published - 1984 |
Event | 1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985 - Paris, France Duration: 11 Apr 1984 → 13 Apr 1984 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 166 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985 |
---|---|
Country/Territory | France |
City | Paris |
Period | 11/04/84 → 13/04/84 |
Bibliographical note
Publisher Copyright:© 1984, Springer Verlag. All rights reserved.