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
Designing secure networks with q-composite key predistribution under different link constraints
In many applications of wireless sensor networks (WSNs), sensors are deployed in hostile environments where an adversary can… 
2011
2011
Robustness to the Loss of Multiple Nodes in the Localizability of Sensor Networks
Abstract In the studies on the localization of wireless sensor networks (WSN), it has been shown that a network is in principle… 
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
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… 
2009
2009
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in sensor networks. We prove that the DRR… 
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… 
1999
1999
Pairwise geometric histograms for object recognition : developments and analysis
One of the fundamental problems in the field of computer vision is the task of classifying objects, which are present in an… 
1995
1995
Nearest Neighbour Graph Realizability is NP-hard
Nearest neighbour graphs are geometric graphs defined on point sets. They express certain proximity relations. This paper gives… 
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)