A polynomial-time algorithm for near-unanimity graphs.
Benoît LaroseCynthia LotenLászló ZádoriPublished in: J. Algorithms (2005)
Keyphrases
- learning algorithm
- worst case
- computational complexity
- np hard
- high accuracy
- experimental evaluation
- search space
- cost function
- graph isomorphism
- optimization algorithm
- lower bound
- preprocessing
- k means
- computational cost
- objective function
- polynomial time complexity
- particle swarm optimization
- clustering method
- random graphs
- finding the shortest path
- hyper graph
- polynomial size
- detection algorithm
- expectation maximization
- search algorithm
- similarity measure
- decision trees