A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis.
Derek RaysideKostas KontogiannisPublished in: CSMR (2002)
Keyphrases
- k means
- benchmark problems
- np hard
- learning algorithm
- recognition algorithm
- computational complexity
- preprocessing
- optimization algorithm
- computational cost
- dynamic programming
- graph structure
- cost function
- graph based algorithm
- probabilistic model
- search space
- tree structure
- solution path
- graph theory
- objective function
- spanning tree
- polynomial time complexity
- maximum weight
- shortest path problem
- undirected graph
- neural network
- matching algorithm
- segmentation algorithm
- worst case
- significant improvement
- search algorithm
- optimal solution