Login / Signup
Solving the Euclidean Bottleneck Biconnected Edge Subgraph Problem by 2-Relative Neighborhood Graphs.
Maw-Shang Chang
Chuan Yi Tang
Richard C. T. Lee
Published in:
Discret. Appl. Math. (1992)
Keyphrases
</>
neighborhood graph
minimum spanning trees
manifold learning
euclidean distance
knn
clustering algorithm
similarity measure
data points
graph construction
data sets
machine learning
data structure
euclidean space
edge weights