Approximate Throughput Computation of Stochastic Marked Graphs.
Javier CamposJosé Manuel ColomHauke JungnitzManuel Silva SuárezPublished in: IEEE Trans. Software Eng. (1994)
Keyphrases
- efficient computation
- graph matching
- subgraph isomorphism
- exact computation
- response time
- graph theoretic
- simple linear
- stochastic optimization
- median graph
- graph theory
- spanning tree
- pre computed
- efficiently computing
- quality guarantees
- data sets
- numerical integration
- series parallel
- maximal cliques
- undirected graph
- probability distribution
- probabilistic model
- dynamic programming