A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
Esha GhoshN. S. NarayanaswamyC. Pandu RanganPublished in: WALCOM (2011)
Keyphrases
- computational complexity
- preprocessing
- dynamic programming
- graph isomorphism
- recognition algorithm
- computational cost
- worst case
- detection algorithm
- learning algorithm
- search space
- convergence rate
- optimization algorithm
- strongly polynomial
- graph structure
- tree structure
- np hard
- similarity measure
- significant improvement
- k means
- path finding
- minimum spanning tree
- optimal solution
- polynomial time complexity