Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

DOI10.1016/J.TCS.2008.10.032zbMATH Open1167.90019OpenAlexW2147868672MaRDI QIDQ1007250FDOQ1007250

Authors: Yingchao Zhao, Shang-Hua Teng 

Publication date: 20 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.032

Recommendations

• Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• Separators for sphere-packings and nearest neighbor graphs

zbMATH Keywords

doubling dimensionneighborhood systemmetric embeddingFiedler valueshallow minor

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Applications of a Planar Separator Theorem
• A Separator Theorem for Planar Graphs
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• Complexity of graph partition problems
• Separators for sphere-packings and nearest neighbor graphs
• Title not available (Why is that?)
• Spectral partitioning works: planar graphs and finite element meshes
• Combinatorial aspects of geometric graphs
• Title not available (Why is that?)
• Finding nearest neighbors in growth-restricted metrics
• Removing randomness in parallel computation without a processor penalty
• On uniform properties of doubling measures

Cited In (1)

• Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces

This page was built for publication: Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

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