Name
Abstract | ||
|---|---|---|
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, and isolation, and we develop bounds based on the Kolmogorov approach. (C) 2000 John Wiley & Sons, Inc. |
Year | DOI | Venue |
|---|---|---|
2000 | 3.0.CO;2-3" target="_self" class="small-link-text"10.1002/1098-2418(200008)17:13.0.CO;2-3 | Random Struct. Algorithms |
Keywords | Field | DocType |
kolmogorov complexity,expander graph | Discrete mathematics,Combinatorics,Expander graph,Graph property,Kolmogorov complexity,Vertex (geometry),struct,Probabilistic logic,Kolmogorov structure function,Mathematics | Journal |
Volume | Issue | ISSN |
17 | 1 | 1042-9832 |
Citations | PageRank | References |
2 | 0.43 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Uwe Schöning | 1 | 998 | 105.69 |