An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs.
Vamsi KundetiSanguthevar RajasekaranHieu DinhPublished in: COCOA (1) (2010)
Keyphrases
- computational cost
- experimental evaluation
- detection algorithm
- graph structure
- search space
- high accuracy
- cost function
- np hard
- learning algorithm
- optimization algorithm
- dynamic programming
- optimal solution
- lower bound
- recognition algorithm
- objective function
- business intelligence
- times faster
- graph theory
- graph matching
- convergence rate
- graph mining
- matching algorithm
- theoretical analysis
- simulated annealing
- probabilistic model
- k means
- computational complexity
- similarity measure