An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
Vamsi KundetiSanguthevar RajasekaranHieu DinhPublished in: CoRR (2010)
Keyphrases
- graph structure
- detection algorithm
- computational cost
- experimental evaluation
- dynamic programming
- computational complexity
- optimization algorithm
- preprocessing
- times faster
- k means
- cost function
- learning algorithm
- high accuracy
- computationally efficient
- simulated annealing
- clustering method
- segmentation algorithm
- objective function
- significant improvement
- search space
- adjacency graph
- max cut
- polynomial time complexity
- memory efficient
- neural network
- convergence rate
- theoretical analysis
- data structure
- genetic algorithm