)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.
Telikepalli KavithaKurt MehlhornDimitrios MichailKatarzyna E. PaluchPublished in: Algorithmica (2008)
Keyphrases
- theoretical analysis
- optimal solution
- experimental evaluation
- square error
- computational complexity
- cost function
- genetic algorithm
- linear programming
- simulated annealing
- high accuracy
- computational cost
- graph structure
- spanning tree
- search space
- preprocessing
- minimum cost
- times faster
- minimum spanning tree
- max cut
- detection algorithm
- optimization algorithm
- dynamic programming
- significant improvement
- k means
- evolutionary algorithm
- learning algorithm
- energy function
- probabilistic model
- recognition algorithm
- space complexity
- graph partitioning
- adjacency graph
- search algorithm