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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we propose a novel algorithm for intelligent drawing based on context awareness in dynamic geometry system. First… 
2011
2011
Abstract In the studies on the localization of wireless sensor networks (WSN), it has been shown that a network is in principle… 
2010
2010
For a random geometric graph G(n, r) of minimum degree δ, we introduce an efficient algorithm for selecting (δ + 1) backbones… 
2010
2010
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane… 
2010
2010
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
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which… 
2006
2006
Abstract algebra: Groups, rings and fields Convex polytopes: Definitions and examples Faces of polytopes Schlegel diagrams Gale… 
2005
2005
For very low power, high bandwidth applications, free space optical sensor networks (FSOSN) have shown potential. They promise… 
2004
2004
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
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for…