84 search results - page 3 / 17 » Asymptotic enumeration of orientations |
JCT
2007
13 years 7 months ago
2007
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
COMBINATORICS
1999
13 years 7 months ago
1999
An asymptotic estimate is given for the coefficients of products of large powers of generating functions. This theorem and another local limit theorem which is useful for conditio...
FFA
2006
13 years 8 months ago
2006
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
COMBINATORICS
2004
13 years 7 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...