Login / Signup
The Complexity of Pursuit on a Graph.
Arthur S. Goldstein
Edward M. Reingold
Published in:
Theor. Comput. Sci. (1995)
Keyphrases
</>
computational complexity
graph theory
graph model
graph based algorithm
computational cost
bounded treewidth
structured data
graph representation
polynomial time complexity
bayesian networks
graph structures
graph structure
bipartite graph
decision problems
worst case
upper bound
special case
lower bound