A Polynomial-Time Algorithm for the Independent Set Problem in P_10, C_4, C_6 -Free Graphs.
Edin HusicMartin MilanicPublished in: WG (2019)
Keyphrases
- independent set
- np hard
- learning algorithm
- k means
- optimal solution
- polynomial time complexity
- particle swarm optimization
- matching algorithm
- approximation ratio
- worst case
- collaborative filtering
- simulated annealing
- ant colony optimization
- convergence rate
- knapsack problem
- approximation algorithms
- graph structure
- maximum weight
- probabilistic model
- dynamic programming