Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs.
C. E. Veni MadhavanPublished in: FSTTCS (1984)
Keyphrases
- optimal solution
- graph clustering
- preprocessing
- np hard
- dynamic programming
- detection algorithm
- learning algorithm
- segmentation algorithm
- approximation ratio
- minimum spanning tree
- matching algorithm
- cost function
- computational complexity
- probabilistic model
- greedy algorithm
- graph theory
- graph structure
- graph theoretic
- k means
- bayesian networks