An Efficient Algorithm for Enumerating Maximal Bicliques from a Dynamically Growing Graph.
Rui WangMingxue LiaoCaixia QinPublished in: ICNC-FSKD (2019)
Keyphrases
- learning algorithm
- computationally efficient
- graph structure
- optimization algorithm
- cost function
- dynamic programming
- similarity measure
- recognition algorithm
- segmentation algorithm
- computational cost
- k means
- np hard
- worst case
- expectation maximization
- search space
- graph based algorithm
- detection algorithm
- clustering method
- maximum flow
- graph model
- optimal solution
- objective function
- dominating set
- minimum spanning tree
- convergence rate
- matching algorithm
- ant colony optimization
- computational complexity
- preprocessing