A Polynomial Algorithm for the Parity Path Problem on Perfectly orientable Graphs.
Srinivasa Rao ArikatiUri N. PeledPublished in: Discret. Appl. Math. (1996)
Keyphrases
- learning algorithm
- experimental evaluation
- preprocessing
- dynamic programming
- computational complexity
- k means
- optimal solution
- graph structure
- optimization algorithm
- recognition algorithm
- high accuracy
- finding the shortest path
- graph model
- times faster
- matching algorithm
- detection algorithm
- segmentation algorithm
- linear programming
- worst case
- search space
- expectation maximization
- clustering method
- computational cost
- significant improvement
- evolutionary algorithm
- shortest path problem
- path length
- polynomial time complexity