To Determine 1-Extendable Graphs and its Algorithm.
Dingjun LouAkira SaitoLihua TengPublished in: Ars Comb. (2003)
Keyphrases
- times faster
- experimental evaluation
- preprocessing
- learning algorithm
- improved algorithm
- computationally efficient
- expectation maximization
- dynamic programming
- objective function
- computational complexity
- theoretical analysis
- detection algorithm
- matching algorithm
- spanning tree
- cost function
- search space
- computational cost
- optimal solution
- worst case
- linear programming
- optimization algorithm
- max cut
- adjacency graph
- convergence rate
- probabilistic model
- significant improvement
- search algorithm
- similarity measure