A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs.
Ramesh HariharanTelikepalli KavithaKurt MehlhornPublished in: ICALP (1) (2006)
Keyphrases
- preprocessing
- learning algorithm
- optimization algorithm
- directed graph
- times faster
- k means
- significant improvement
- detection algorithm
- dynamic programming
- clustering method
- np hard
- highly efficient
- experimental evaluation
- matching algorithm
- objective function
- computational cost
- convex hull
- recognition algorithm
- memory efficient
- simulated annealing
- shortest path problem
- square error
- segmentation algorithm
- worst case
- probabilistic model
- search space
- computational complexity
- social networks