Sciweavers

102 search results - page 2 / 21
» Geometric properties of Assur graphs
Sort
View
EJC
2010
13 years 5 months ago
Combinatorial characterization of the Assur graphs from engineering
We introduce the idea of Assur graphs, a concept originally developed and exclusively employed in the literature of the kinematics community. The paper translates the terminology,...
Brigitte Servatius, Offer Shai, Walter Whiteley
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 5 months ago
Sharp thresholds For monotone properties in random geometric graphs
Ashish Goel, Sanatan Rai, Bhaskar Krishnamachari
DM
2008
73views more  DM 2008»
13 years 5 months ago
Graphs with the n-e.c. adjacency property constructed from affine planes
We give new examples of graphs with the n-e.c. adjacency property. Few explicit families of n-e.c. graphs are known, despite the fact that almost all finite graphs are n-e.c. Our ...
C. A. Baker, Anthony Bonato, Julia M. Nowlin Brown...
CCCG
2010
13 years 6 months ago
Some properties of higher order delaunay and gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
Prosenjit Bose, Sébastien Collette, Ferran ...
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 6 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler