A competitive algorithm to find all defective edges in a graph.
Frank K. HwangPublished in: Discret. Appl. Math. (2005)
Keyphrases
- weighted graph
- learning algorithm
- similarity measure
- recognition algorithm
- optimization algorithm
- cost function
- dynamic programming
- graph based algorithm
- spanning tree
- np hard
- computational cost
- minimum spanning tree
- undirected graph
- detection algorithm
- shortest path problem
- probabilistic model
- search space
- preprocessing
- computational complexity
- multiscale
- bayesian networks
- neural network
- edge weights
- dominating set
- graph model
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- worst case