Login / Signup
The Complexity of Collapsing Reachability Graphs.
Sudhir Aggarwal
Daniel Barbará
Walter Cunto
M. R. Garey
Published in:
Automatic Verification Methods for Finite State Systems (1989)
Keyphrases
</>
graph theory
space complexity
objective function
computational complexity
series parallel
neural network
real world
case study
search algorithm
computational cost
state space
decision problems
transitive closure
subgraph isomorphism
labeled graphs