{"title":"Explicit constructions of linear size superconcentrators","authors":"O. Gabber, Z. Galil","doi":"10.1109/SFCS.1979.16","DOIUrl":null,"url":null,"abstract":"We present an explicit construction of an infinite family of N-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.","PeriodicalId":311166,"journal":{"name":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"439","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th Annual Symposium on Foundations of Computer Science (sfcs 1979)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1979.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 439
Abstract
We present an explicit construction of an infinite family of N-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.