Parameterized algorithm for weighted independent set problem in bull-free graphs.
Stéphan ThomasséNicolas TrotignonKristina VuskovicPublished in: CoRR (2013)
Keyphrases
- independent set
- detection algorithm
- objective function
- maximum weight
- dynamic programming
- k means
- computational complexity
- optimal solution
- learning algorithm
- probabilistic model
- weighted graph
- random graphs
- special case
- simulated annealing
- segmentation algorithm
- shortest path
- ant colony optimization
- matching algorithm
- knapsack problem
- average case
- graph isomorphism