We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2 × 2 matrices whose entries sum to d, and we construct an algorithm to compute improved upper bounds for the covering numbers.
Authors
Babcock B; van Tuyl A
Journal
Australasian Journal of Combinatorics, Vol. 56, , pp. 77–84