An algorithm for calculating the independence and vertex-cover polynomials of a graph.
Gordon G. CashPublished in: Appl. Math. Comput. (2007)
Keyphrases
- vertex cover
- approximation algorithms
- learning algorithm
- dynamic programming
- theoretical analysis
- worst case
- computational complexity
- optimal solution
- special case
- expectation maximization
- energy function
- np hard
- probabilistic model
- lower bound
- parameter estimation
- connected components
- weighted graph
- undirected graph
- bin packing
- planar graphs
- optimality criterion