A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs.
José Raymundo Marcial-RomeroGuillermo De Ita LunaAurelio López-LópezRosa Maria ValdovinosPublished in: MICAI (Special Session) (2016)
Keyphrases
- computational complexity
- polynomial time complexity
- preprocessing
- detection algorithm
- learning algorithm
- worst case
- dynamic programming
- cost function
- k means
- similarity measure
- optimal solution
- computational cost
- np hard
- lower bound
- space complexity
- finding the shortest path
- strongly polynomial
- alphabet size
- neural network
- approximation ratio
- graph search
- random graphs
- undirected graph
- matching algorithm
- special case
- optimization algorithm
- expectation maximization
- linear programming
- probabilistic model