Skip to search formSkip to main contentSkip to account menu

Geometric graph theory

Known as: Euclidean graph, Geometric graph 
A geometric graph is a graph in which the vertices or edges are associated with geometric objects, the simplest realisation is a Random geometric… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Algebraic graph theoryBeta skeletonCircle packing theoremDelaunay triangulation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Counting $k$ -Hop Paths in the Random Connection Model
We study, via combinatorial enumeration, the probability of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline… 
2012
2012
The significant impact of a set of topologies on wireless sensor networks
Routing and topology control for Wireless Sensor Networks (WSNs) is significantly important to achieve energy efficiency in… 
2010
2010
Employing (1 − ε) dominating set partitions as backbones in wireless sensor networks
For a random geometric graph G(n, r) of minimum degree δ, we introduce an efficient algorithm for selecting (δ + 1) backbones… 
2010
2010
On Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane… 
2010
2010
REGO: Rank-based Estimation of Renyi Information using Euclidean Graph Optimization
We propose a new method for a non- parametric estimation of Renyi and Shan- non information for a multivariate distribu- tion… 
Highly Cited
2009
Highly Cited
2009
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which… 
2008
2008
Number of Crossing-Free Geometric Graphs vs. Triangulations
2005
2005
Efficient routing protocols for a free space optical sensor network
For very low power, high bandwidth applications, free space optical sensor networks (FSOSN) have shown potential. They promise… 
2004
2004
On locally Delaunay geometric graphs
A geometric graph is a simple graph <i>G=(V,E)</i> with an embedding of the set <i>V</i> in the plane such that the points that… 
1993
1993
Worst-case bounds for subadditive geometric graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)