A faster algorithm to recognize even-hole-free graphs.
Hsien-Chih ChangHsueh-I LuPublished in: J. Comb. Theory, Ser. B (2015)
Keyphrases
- experimental evaluation
- preprocessing
- learning algorithm
- search space
- computational complexity
- k means
- expectation maximization
- segmentation algorithm
- optimization algorithm
- detection algorithm
- np hard
- matching algorithm
- objective function
- hyper graph
- times faster
- improved algorithm
- memory efficient
- graph isomorphism
- theoretical analysis
- high accuracy
- input data
- computational cost
- dynamic programming
- optimal solution
- similarity measure
- decision trees
- simulated annealing
- worst case
- cost function
- lower bound
- graph model
- minimum spanning tree
- bayesian networks
- graph construction
- adjacency graph