Results 1  10
of
2,312
Design of capacityapproaching irregular lowdensity paritycheck codes
 IEEE TRANS. INFORM. THEORY
, 2001
"... We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming that the unde ..."
Abstract

Cited by 588 (6 self)
 Add to MetaCart
We design lowdensity paritycheck (LDPC) codes that perform at rates extremely close to the Shannon capacity. The codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. Our theoretical analysis of the codes is based on [1]. Assuming
A new approach to the maximum flow problem
 JOURNAL OF THE ACM
, 1988
"... All previously known efficient maximumflow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortestlength augmenting paths at once (using the layered network approach of Dinic). An alternative method based on the pre ..."
Abstract

Cited by 672 (33 self)
 Add to MetaCart
of the algorithm running in O(nm log(n²/m)) time on an nvertex, medge graph. This is as fast as any known method for any graph density and faster on graphs of moderate density. The algorithm also admits efticient distributed and parallel implementations. A parallel implementation running in O(n²log n) time using
Finding community structure in networks using the eigenvectors of matrices
, 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract

Cited by 502 (0 self)
 Add to MetaCart
We consider the problem of detecting communities or modules in networks, groups of vertices with a higherthanaverage density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible
On the influence of graph density on randomized gossiping
 Proceedings of the 29th IEEE International Parallel & Distributed Processing Symposium (IPDPS
"... Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, known as the broadcasting problem, a single message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the socalled random pho ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Information dissemination is a fundamental problem in parallel and distributed computing. In its simplest variant, known as the broadcasting problem, a single message has to be spread among all nodes of a graph. A prominent communication protocol for this problem is based on the socalled random
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 683 (1 self)
 Add to MetaCart
problems occur at a critical value of such a parameter. This critical value separates two regions of characteristically different properties. For example, for Kcolorability, the critical value separates overconstrained from underconstrained random graphs, and it marks the value at which the probability
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 475 (67 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
On the graphdensity of random 0/1polytopes
 APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION (PROC. RANDOM03). VOLUME 2764 OF LECTURE
, 2003
"... Let Xd,n be an nelement subset of {0, 1} d chosen uniformly at random, and denote by Pd,n: = conv Xd,n its convex hull. Let ∆d,n be the density of the graph of Pd,n (i.e., the number of onedimensional faces of Pd,n divided by ` ´ n). Our main result is that, for any function 2 n(d), the expecte ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Let Xd,n be an nelement subset of {0, 1} d chosen uniformly at random, and denote by Pd,n: = conv Xd,n its convex hull. Let ∆d,n be the density of the graph of Pd,n (i.e., the number of onedimensional faces of Pd,n divided by ` ´ n). Our main result is that, for any function 2 n
Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
"... Abstract. We deal with the problem of finding such an orientation of a given graph that the largest number of edges leaving a vertex (called the outdegree of the orientation) is small. For any ε ∈ (0, 1) we show an Õ(E(G)/ε) time algorithm3 which finds an orientation of an input graph G with outde ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
with outdegree at most ⌈(1 + ε)d ∗ ⌉, where d ∗ is the maximum density of a subgraph of G. It is known that the optimal value of orientation outdegree is ⌈d ∗ ⌉. Our algorithm has applications in constructing labeling schemes, introduced by Kannan et al. in [18] and in approximating such graph density measures
Refining the graph density condition for the existence of an almost Kfactor
 ARS COMBINATORICA
, 1999
"... Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)colorable, then any graph G with n vertices and minimum degree at least h n h+1n contains at least (1 − ɛ) g vertex disjoint copies of K, provided n> N(ɛ). It is shown here that the required minimum degree of G for t ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)colorable, then any graph G with n vertices and minimum degree at least h n h+1n contains at least (1 − ɛ) g vertex disjoint copies of K, provided n> N(ɛ). It is shown here that the required minimum degree of G
Approximating the permanent
 SIAM J. Computing
, 1989
"... Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the ..."
Abstract

Cited by 345 (26 self)
 Add to MetaCart
Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings
Results 1  10
of
2,312