On the performance of the first-fit coloring algorithm on permutation graphs.
Stavros D. NikolopoulosCharis PapadopoulosPublished in: Inf. Process. Lett. (2000)
Keyphrases
- dynamic programming
- high accuracy
- preprocessing
- cost function
- detection algorithm
- improved algorithm
- simulated annealing
- input data
- max cut
- graph construction
- graph structure
- times faster
- matching algorithm
- tree structure
- expectation maximization
- learning algorithm
- worst case
- np hard
- significant improvement
- computational complexity
- optimization algorithm
- probabilistic model
- computational cost
- recognition algorithm
- graph clustering
- graph theoretical
- similarity measure