A determinant-based algorithm for counting perfect matchings in a general graph.
Steve ChienPublished in: SODA (2004)
Keyphrases
- graph based algorithm
- experimental evaluation
- computational complexity
- learning algorithm
- dynamic programming
- preprocessing
- k means
- cost function
- worst case
- objective function
- times faster
- matching algorithm
- detection algorithm
- search space
- breadth first search
- minimum spanning tree
- tree structure
- segmentation algorithm
- particle swarm optimization
- simulated annealing
- computational cost
- expectation maximization
- clustering method
- recognition algorithm
- graph model
- graph representation
- similarity measure
- significant improvement
- neural network