An O(VE) algorithm for ear decompositions of matching-covered graphs.
Marcelo Henriques de CarvalhoJoseph CheriyanPublished in: SODA (2005)
Keyphrases
- matching algorithm
- cost function
- computational complexity
- preprocessing
- objective function
- detection algorithm
- segmentation algorithm
- worst case
- learning algorithm
- minimum spanning tree
- string matching
- optimization algorithm
- feature points
- computational cost
- k means
- search space
- optimal solution
- np hard
- clustering method
- similarity measure
- directed graph
- recognition algorithm
- face recognition
- genetic algorithm
- random graphs
- approximate matching
- maximum cardinality