Sciweavers

113 search results - page 7 / 23
» Rigid Components of Random Graphs
Sort
View
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 4 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 28 days ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
BIOINFORMATICS
2007
83views more  BIOINFORMATICS 2007»
13 years 6 months ago
Exploring biological network structure using exponential random graph models
Motivation: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus ...
Zachary M. Saul, Vladimir Filkov
CCCG
2009
13 years 7 months ago
Generalized jewels and the point placement problem
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
Md. Shafiul Alam, Asish Mukhopadhyay, Animesh Sark...
CPC
2007
125views more  CPC 2007»
13 years 6 months ago
Adversarial Deletion in a Scale-Free Random Graph Process
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera