A Faster Algorithm for Minimum Cycle Basis of Graphs.
Telikepalli KavithaKurt MehlhornDimitrios MichailKatarzyna E. PaluchPublished in: ICALP (2004)
Keyphrases
- cost function
- k means
- improved algorithm
- times faster
- expectation maximization
- dynamic programming
- theoretical analysis
- square error
- preprocessing
- computational cost
- objective function
- computational complexity
- optimization algorithm
- learning algorithm
- energy function
- search space
- highly efficient
- spanning tree
- hyper graph
- similarity measure
- graph cuts
- simulated annealing
- undirected graph
- global minimum
- subgraph isomorphism
- graph isomorphism