Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
From MaRDI portal
(Redirected from Publication:1007250)
Recommendations
Cites work
- scientific article; zbMATH DE number 1003278 (Why is no real title available?)
- scientific article; zbMATH DE number 3871421 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Combinatorial aspects of geometric graphs
- Complexity of graph partition problems
- Finding nearest neighbors in growth-restricted metrics
- On uniform properties of doubling measures
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Removing randomness in parallel computation without a processor penalty
- Separators for sphere-packings and nearest neighbor graphs
- Spectral partitioning works: planar graphs and finite element meshes
Cited in
(1)
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)