540 search results - page 39 / 108 » New bounds on the edge number of a k-map graph |
CORR
2007
Springer
13 years 8 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
JGT
2010
13 years 7 months ago
2010
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
ISPDC
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
COMBINATORICS
2006
13 years 8 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
SODA
1998
ACM
13 years 10 months ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...