Combinatorial aspects of geometric graphs

DOI10.1016/S0925-7721(96)00008-9zbMath0894.68157MaRDI QIDQ1384214

Shang-Hua Teng

Publication date: 30 August 1998

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

hypercube graphshypercubic parallel machines

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Spectral partitioning works: planar graphs and finite element meshes ⋮ Grid minors in damaged grids ⋮ Grad and classes with bounded expansion. II: Algorithmic aspects ⋮ Non-existence of annular separators in geometric graphs ⋮ Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

Uses Software

• MESHPART

Cites Work

• Efficient out-of-core algorithms for linear relaxation using blocking covers
• \(k\)-nearest-neighbor clustering and percolation theory
• On the homogeneous planar Poisson point process
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• A Separator Theorem for Planar Graphs
• Stable Finite Elements for Problems with Wild Coefficients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial aspects of geometric graphs