An Augmenting Path Algorithm for the Parity Problem on Linear Matroids
Matthias F. M. StallmannHarold N. GabowPublished in: FOCS (1984)
Keyphrases
- learning algorithm
- experimental evaluation
- np hard
- computational cost
- computational complexity
- preprocessing
- linear complexity
- shortest path problem
- recognition algorithm
- cost function
- dynamic programming
- matching algorithm
- high accuracy
- detection algorithm
- times faster
- improved algorithm
- search space
- theoretical analysis
- shortest path
- optimization algorithm
- data sets
- similarity measure
- optimal path
- k means
- error correction
- input data
- closed form
- energy function
- segmentation algorithm
- significant improvement
- data structure
- neural network