) algorithm for ear decompositions of matching-covered graphs.
Marcelo Henriques de CarvalhoJoseph CheriyanPublished in: ACM Trans. Algorithms (2005)
Keyphrases
- matching algorithm
- detection algorithm
- preprocessing
- computational cost
- learning algorithm
- graph structure
- optimization algorithm
- probabilistic model
- optimal solution
- matching process
- cost function
- dynamic programming
- expectation maximization
- recognition algorithm
- simulated annealing
- np hard
- significant improvement
- image set
- search space
- lower bound
- graph model
- spanning tree
- graph partitioning
- minimum spanning tree
- matching scheme
- polynomial time complexity