Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths.
Aistis AtminasVadim V. LozinIgor RazgonPublished in: SWAT (2012)
Keyphrases
- learning algorithm
- dynamic programming
- segmentation algorithm
- worst case
- recognition algorithm
- experimental evaluation
- graph structure
- np hard
- times faster
- detection algorithm
- k means
- optimal path
- space complexity
- shortest path
- optimization algorithm
- neural network
- computational complexity
- cost function
- preprocessing
- np complete
- objective function
- probabilistic model
- optimal solution
- tree structure
- directed graph
- similarity measure
- significant improvement
- minimum length
- homology generators