Space Lower Bounds for Graph Exploration via Reduced Automata.
Pierre FraigniaudDavid IlcinkasSergio RajsbaumSébastien TixeuilPublished in: SIROCCO (2005)
Keyphrases
- lower bound
- upper bound
- equivalence classes
- directed graph
- cellular automata
- low dimensional
- objective function
- graph structure
- branch and bound algorithm
- space time
- min sum
- worst case
- search space
- structured data
- bipartite graph
- graph theory
- finite state machines
- learning algorithm
- tree automata
- min cut
- turing machine
- nearest neighbor graph