Linear time algorithm for deciding the behavior of a graph under the iterated biclique operator.
Marina GroshausAndré Luiz Pires GuedesLeandro MonteroPublished in: CoRR (2014)
Keyphrases
- optimization algorithm
- learning algorithm
- graph based algorithm
- preprocessing
- detection algorithm
- np hard
- graph model
- graph structure
- significant improvement
- worst case
- similarity measure
- convergence rate
- segmentation algorithm
- computational cost
- cost function
- computational complexity
- optimal solution
- random walk
- dynamic programming
- tree structure
- k means
- recognition algorithm
- graph theory
- search space
- spanning tree
- maximum flow