Low - exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs.
José Antonio Hernández ServínJosé Raymundo Marcial-RomeroGuillermo De Ita LunaPublished in: LANMR (2014)
Keyphrases
- undirected graph
- computational complexity
- detection algorithm
- cost function
- optimization algorithm
- memory requirements
- space complexity
- minimum spanning tree
- random graphs
- linear complexity
- learning algorithm
- np hard
- evolutionary algorithm
- spanning tree
- clustering method
- convergence rate
- false negative
- color constancy
- polynomial time complexity
- neural network
- times faster
- segmentation algorithm
- simulated annealing
- preprocessing
- matching algorithm
- weighted graph
- np complete
- graphical models
- input image
- computational cost
- similarity measure
- genetic algorithm