Sciweavers

15 search results - page 3 / 3
» Ramsey numbers of sparse hypergraphs
Sort
View
JPDC
2008
110views more  JPDC 2008»
13 years 4 months ago
Parallel multilevel algorithms for hypergraph partitioning
In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe schemes for parallel coarsening, parallel greedy k-way...
Aleksandar Trifunovic, William J. Knottenbelt
SIAMSC
2010
210views more  SIAMSC 2010»
12 years 11 months ago
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
Ümit V. Çatalyürek, Cevdet Aykana...
RSA
2011
124views more  RSA 2011»
12 years 12 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 8 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
13 years 9 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo