An Efficient Algorithm for Workflow Graph Structural Verification.
Fodé TouréKarim BaïnaKhalid BenaliPublished in: OTM Conferences (1) (2008)
Keyphrases
- computationally efficient
- optimal solution
- preprocessing
- k means
- cost function
- dynamic programming
- detection algorithm
- learning algorithm
- high accuracy
- graph structure
- recognition algorithm
- experimental evaluation
- optimization algorithm
- random walk
- graph based algorithm
- graph partitioning
- maximum flow
- neural network
- expectation maximization
- computational cost
- genetic algorithm
- graph cuts
- worst case
- convergence rate
- search space
- computational complexity
- graph model
- undirected graph
- web services
- social networks