102 search results - page 3 / 21 » Geometric properties of Assur graphs |
WAW
2007
Springer
14 years 1 months ago
2007
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The overlap number of a finite (d + 1)-uniform hypergraph H is the largest constant c(H) (0, 1] such that no matter how we map the vertices of H into Rd , there is a point covered...
ENDM
2008
13 years 7 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
Let
SIROCCO
2001
13 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...