Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers.
Sandi KlavzarAleksander VeselPublished in: Discret. Appl. Math. (2003)
Keyphrases
- preprocessing
- learning algorithm
- optimal solution
- graph based algorithm
- expectation maximization
- graph structure
- computational cost
- np hard
- detection algorithm
- simulated annealing
- dynamic programming
- shortest path problem
- evolutionary algorithm
- maximum flow
- objective function
- homology generators
- graph theory
- minimum spanning tree
- graph matching
- combinatorial optimization
- image matching
- matching algorithm
- clustering method
- segmentation algorithm
- dynamic environments
- worst case
- probabilistic model
- k means
- search space
- lower bound
- search algorithm
- clustering algorithm