A certifying algorithm for 3-colorability of P5-free graphs
Daniel BruceChính T. HoàngJoe SawadaPublished in: CoRR (2009)
Keyphrases
- learning algorithm
- computational complexity
- dynamic programming
- improved algorithm
- experimental evaluation
- times faster
- significant improvement
- search space
- matching algorithm
- graph model
- preprocessing
- worst case
- expectation maximization
- k means
- tree structure
- recognition algorithm
- optimization algorithm
- graph isomorphism
- probabilistic model
- optimal solution
- lower bound
- max cut
- weighted graph
- graph clustering
- high accuracy
- convergence rate
- ant colony optimization
- segmentation algorithm
- theoretical analysis
- np hard
- cost function
- objective function
- similarity measure