A combinatorial algorithm for computing a maximum independent set in a t-perfect graph.
Friedrich EisenbrandStefan FunkeNaveen GargJochen KönemannPublished in: SODA (2003)
Keyphrases
- graph based algorithm
- computational complexity
- graph structure
- cost function
- detection algorithm
- optimization algorithm
- segmentation algorithm
- graph theory
- dynamic programming
- clustering method
- search space
- preprocessing
- optimal solution
- objective function
- maximum independent set
- graph partitioning
- graph clustering
- learning algorithm
- combinatorial optimization
- probabilistic model
- computational cost
- similarity measure
- expectation maximization
- graph theoretic
- depth first search
- image segmentation
- genetic algorithm