27 search results - page 3 / 6 » Giant Component and Connectivity in Geographical Threshold G... |
HT
2009
ACM
14 years 2 months ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
JCT
2008
13 years 7 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
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...
APPROX
2004
Springer
14 years 26 days ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
SODA
2007
ACM
13 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...