The Reduced Automata Technique for Graph Exploration Space Lower Bounds.
Pierre FraigniaudDavid IlcinkasSergio RajsbaumSébastien TixeuilPublished in: Essays in Memory of Shimon Even (2006)
Keyphrases
- lower bound
- upper bound
- equivalence classes
- cellular automata
- graph structure
- nearest neighbor graph
- search space
- low dimensional
- structured data
- objective function
- bipartite graph
- graph representation
- undirected graph
- vector space
- finite automata
- directed acyclic graph
- branch and bound algorithm
- random walk
- data structure