An Upper Bound of 7n/6 for the Minimum Size 2EC on Cubic 3-Edge Connected Graphs.
Philippe LegaultPublished in: CoRR (2017)
Keyphrases
- upper bound
- constant factor
- lower bound
- worst case
- approximation algorithms
- edge information
- connected graphs
- image processing
- edge detection
- electronic commerce
- small size
- upper and lower bounds
- edge detector
- branch and bound
- search algorithm
- genetic algorithm
- branch and bound algorithm
- database
- edge map
- computer vision
- neural network