29 search results - page 6 / 6 » Generating Outerplanar Graphs Uniformly at Random |
STOC
2010
ACM
13 years 5 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
FOCS
2009
IEEE
14 years 3 days ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
SIGMETRICS
2002
ACM
13 years 5 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...