Login / Signup
Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges.
Klaus Heeger
Jens Vygen
Published in:
SIAM J. Discret. Math. (2017)
Keyphrases
</>
directed graph
traveling salesman problem
straight edges
edge information
data structure
image structure
weighted graph
image edges
data sets
data mining
multiscale
query language
shortest path
edge detector
subgraph matching