Edge integrity of nearest neighbor graphs and separator theorems

DOI10.1016/j.disc.2019.06.007zbMath1416.05223OpenAlexW2950700285WikidataQ127671738 ScholiaQ127671738MaRDI QIDQ2312806

Dominic Lanphier, Molly Dunkum

Publication date: 18 July 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.06.007

zbMATH Keywords

integrityedge integrityseparatornearest neighbor graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Minimax signal generation and reception algorithms
• Edge-isoperimetric inequalities in the grid
• Edge separators for graphs of bounded genus with applications
• Edge-integrity: A survey
• Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
• A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree.
• On the sphere problem
• Geometric measure theory.
• Vulnerability of nearest neighbor graphs
• A Separator Theorem for Planar Graphs
• Applications of a Planar Separator Theorem
• Edge Separators of Planar and Outerplanar Graphs With Applications
• Exponential Sums and Lattice Points II
• Planar Separators
• Separators for sphere-packings and nearest neighbor graphs
• How Good is Recursive Bisection?
• Geometric Separators for Finite-Element Meshes
• Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge integrity of nearest neighbor graphs and separator theorems