scientific article; zbMATH DE number 1222330

MaRDI QIDQ4217847zbMATH OpenFDO

Authors José M. González-Barrios

Publication date 11 November 1998

zbMATH Keywords

connected graphnearest neighborrandom clustering

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Geometric probability and stochastic geometry (60D05) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Connectivity of random k-nearest-neighbour graphs
• scientific article; zbMATH DE number 1340281
• On the Connectivity of Random k-th Nearest Neighbour Graphs
• On nearest-neighbor graphs
• On nearest-neighbor graphs

Cited in

(15)

• k-connectivity in random undirected graphs
• On nearest-neighbor graphs
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• On the number of weakly connected subdigraphs in random \(k\)NN digraphs
• The size of components in continuum nearest-neighbor graphs
• Discussion about properties of first nearest neighbor graphs
• Randomized near-neighbor graphs, giant components and applications in data science
• scientific article; zbMATH DE number 1340281 (Why is no real title available?)
• Small components in \(k\)-nearest neighbour graphs
• A cluster problem as defined by nearest neighbours
• Connectivity of random k-nearest-neighbour graphs
• scientific article; zbMATH DE number 1369838 (Why is no real title available?)
• On the Connectivity of Random k-th Nearest Neighbour Graphs
• On nearest-neighbor graphs
• Largest nearest-neighbour link and connectivity threshold in a polytopal random sample

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4217847)