New Bounds for Timed Event Graphs Inspired by Stochastic Majorization Results.
Laurent TruffetPublished in: Discret. Event Dyn. Syst. (2004)
Keyphrases
- stage stochastic programs
- upper bound
- graph matching
- petri net
- lower bound
- graph theoretic
- event detection
- graph theory
- discrete event
- upper and lower bounds
- lower and upper bounds
- worst case
- graph structure
- subgraph isomorphism
- graph mining
- error bounds
- complex events
- random graphs
- graph clustering
- spanning tree
- stochastic programming
- stochastic processes
- stochastic model
- vc dimension
- bipartite graph
- monte carlo
- hidden markov models