A faster algorithm to recognize even-hole-free graphs.
Hsien-Chih ChangHsueh-I LuPublished in: SODA (2012)
Keyphrases
- detection algorithm
- computational complexity
- improved algorithm
- optimization algorithm
- cost function
- times faster
- worst case
- learning algorithm
- theoretical analysis
- high accuracy
- dynamic programming
- preprocessing
- np hard
- experimental evaluation
- linear programming
- expectation maximization
- data structure
- convergence rate
- highly efficient
- graph partitioning
- recognition algorithm
- graph clustering
- adjacency graph
- finding the shortest path
- segmentation algorithm
- significant improvement
- k means
- search space
- objective function
- bayesian networks
- similarity measure