An exact exponential time algorithm for counting bipartite cliques.
Konstantin KutzkovPublished in: Inf. Process. Lett. (2012)
Keyphrases
- learning algorithm
- detection algorithm
- experimental evaluation
- optimization algorithm
- high accuracy
- k means
- theoretical analysis
- brute force
- significant improvement
- dynamic programming
- recognition algorithm
- weighted graph
- expectation maximization
- graph model
- optimal solution
- graph partitioning
- linear complexity
- times faster
- segmentation algorithm
- simulated annealing
- computational cost
- computational complexity
- image sequences