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: Computación y Sistemas (2017)
Keyphrases
- computational complexity
- detection algorithm
- space complexity
- dynamic programming
- learning algorithm
- linear complexity
- memory requirements
- times faster
- similarity measure
- graph construction
- optimization algorithm
- particle swarm optimization
- polynomial time complexity
- exponential size
- segmentation algorithm
- computational cost
- np hard
- adjacency graph
- search space
- optimal solution
- preprocessing
- undirected graph
- convergence rate
- edge detection algorithm
- objective function
- minimum spanning tree
- worst case
- edge detector
- cost function
- matching algorithm
- probabilistic model
- simulated annealing