Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata.
Paul BeameAllan BorodinPrabhakar RaghavanWalter L. RuzzoMartin TompaPublished in: Inf. Comput. (1996)
Keyphrases
- directed graph
- weighted graph
- undirected graph
- graph representation
- structured data
- graph theory
- equivalence classes
- space time
- graph theoretic
- random walk
- graph partitioning
- parameter space
- search space
- nearest neighbor graph
- bipartite graph
- graph construction
- probability measure
- finite state
- graph model
- data sets
- vector space
- shortest path
- low dimensional
- markov random field
- feature space