Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
Krishnendu ChatterjeeRasmus Ibsen-JensenAndreas PavlogiannisPublished in: CAV (1) (2015)
Keyphrases
- times faster
- highly efficient
- graph theory
- computational cost
- upper bound
- worst case
- data structure
- computationally demanding
- space complexity
- model checking
- theoretical analysis
- query processing
- computational complexity
- learning algorithm
- optimization problems
- search space
- graph theoretic
- representational power
- graph properties