Local properties of geometric graphs
From MaRDI portal
Publication:2456666
DOI10.1016/J.COMGEO.2007.05.011zbMATH Open1124.05067OpenAlexW2160337601MaRDI QIDQ2456666FDOQ2456666
Authors: Jean Cardinal, Sébastien Collette, Stefan Langerman
Publication date: 19 October 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.05.011
Recommendations
Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Self-adjusting binary search trees
- On nearest-neighbor graphs
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- Classes of graphs which approximate the complete Euclidean graph
- Ordered theta graphs
- Generalized Delaunay triangulation for planar graphs
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Empty region graphs
- Proximate planar point location
- Proximate point searching
- Title not available (Why is that?)
Cited In (12)
- Geometric spanning trees minimizing the Wiener index
- Global cycle properties of locally isometric graphs
- Local-Global Phenomena in Graphs
- Local polyhedra and geometric graphs
- Local geometry of the 𝑘-curve graph
- Sigma-local graphs
- Title not available (Why is that?)
- Local polyhedra and geometric graphs
- On locally Delaunay geometric graphs
- On locally Gabriel geometric graphs
- Two local properties of graphs
- Geometric spanning trees minimizing the Wiener index
This page was built for publication: Local properties of geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456666)