Login / Signup
Solving the path cover problem on circular-arc graphs by using an approximation algorithm.
Ruo-Wei Hung
Maw-Shang Chang
Published in:
Discret. Appl. Math. (2006)
Keyphrases
</>
learning algorithm
optimal solution
graph structure
np hard
computer vision
principal component analysis
input data
graph cuts
energy function
hough transform
approximation algorithms
image space