Sciweavers

246 search results - page 1 / 50
» Bichain graphs: Geometric model and universal graphs
Sort
View
CCCG
2009
13 years 12 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 5 months ago
A Geometric Preferential Attachment Model of Networks II
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...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
COMPGEOM
2003
ACM
14 years 4 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
14 years 20 days ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 11 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi