Abstract
The paper characterizes a special class of Cellular Automaton (CA) called Two Predecessor Single Attractor CA (TPSA-CA). We show that the transition graphs of the TPSA-CA can be used to realize pseudo-random regular graphs with good expansion properties. The elegance of the scheme lies in the fact that the storage required to capture the graph is O(log N), where N is the total number of vertices in the graph. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Mukhopadhyay, D. (2012). Generating expander graphs using cellular automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 52–62). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
