Sciweavers

APPROX
2006
Springer
91views Algorithms» more  APPROX 2006»
13 years 7 months ago
Threshold Functions for Asymmetric Ramsey Properties Involving Cliques
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
Martin Marciniszyn, Jozef Skokan, Reto Spöhel...
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
13 years 9 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
13 years 9 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