An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs.
Vamsi KundetiSanguthevar RajasekaranHieu DinhPublished in: Discret. Math. Algorithms Appl. (2012)
Keyphrases
- graph structure
- times faster
- learning algorithm
- objective function
- experimental evaluation
- np hard
- cost function
- computational cost
- significant improvement
- particle swarm optimization
- computationally efficient
- search space
- preprocessing
- computational complexity
- optimal solution
- simulated annealing
- dynamic programming
- directed graph
- detection algorithm
- convergence rate
- optimization algorithm
- graph partitioning
- worst case
- probabilistic model
- neural network
- multi objective
- k means
- search algorithm
- bayesian networks
- data mining