Sciweavers

Share
RSA
2000

Construction of expanders and superconcentrators using Kolmogorov complexity

9 years 10 months ago
Construction of expanders and superconcentrators using Kolmogorov complexity
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the best known bounds on the size of expanders and superconcentrators can be attained based on this method. In the case of (acyclic) superconcentrators we attain a density of about 34 edges/vertices. Furthermore, related graph properties are reviewed, like magnification, edge-magnification, isolation, and develop bounds based on the Kolmogorov approach.
Uwe Schöning
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where RSA
Authors Uwe Schöning
Comments (0)
books