LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs.
Derek G. CorneilBarnaby DaltonMichel HabibPublished in: SIAM J. Comput. (2013)
Keyphrases
- preprocessing
- learning algorithm
- computational cost
- optimization algorithm
- experimental evaluation
- times faster
- detection algorithm
- objective function
- k means
- np hard
- solution path
- dynamic programming
- expectation maximization
- graph structure
- matching algorithm
- graph cuts
- genetic algorithm
- tree structure
- linear programming
- worst case
- convex hull
- graph theory
- significant improvement
- optimal path
- shortest path problem
- computational complexity
- square error