---
res:
bibo_abstract:
- An N-superconcentrator is a directed, acyclic graph with N input nodes and N output
nodes such that every subset of the inputs and every subset of the outputs of
same cardinality can be connected by node-disjoint paths. It is known that linear-size
and bounded-degree superconcentrators exist. We prove the existence of such superconcentrators
with asymptotic density 25.3 (where the density is the number of edges divided
by N). The previously best known densities were 28 [12] and 27.4136 [17].@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Vladimir
foaf_name: Kolmogorov, Vladimir
foaf_surname: Kolmogorov
foaf_workInfoHomepage: http://www.librecat.org/personId=3D50B0BA-F248-11E8-B48F-1D18A9856A87
- foaf_Person:
foaf_givenName: Michal
foaf_name: Rolinek, Michal
foaf_surname: Rolinek
foaf_workInfoHomepage: http://www.librecat.org/personId=3CB3BC06-F248-11E8-B48F-1D18A9856A87
bibo_issue: '10'
bibo_volume: 141
dct_date: 2018^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0381-7032
dct_language: eng
dct_publisher: Charles Babbage Research Centre@
dct_title: Superconcentrators of density 25.3@
...