An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover.
Yusuke KobayashiTakashi NoguchiPublished in: CoRR (2023)
Keyphrases
- np hard
- detection algorithm
- dynamic programming
- edge detection algorithms
- computational complexity
- preprocessing
- optimal solution
- search space
- cost function
- edge detection
- recognition algorithm
- convergence rate
- error bounds
- learning algorithm
- edge detection algorithm
- cubic spline interpolation
- gradient information
- matching algorithm
- optimization algorithm
- objective function
- segmentation algorithm
- edge detector
- particle swarm optimization
- simulated annealing
- undirected graph
- edge points
- probabilistic model
- polynomial time approximation
- edge direction
- edge linking
- similarity measure
- neural network