๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the constructive enumeration of packings and coverings of index one

โœ Scribed by A.J. Petrenjuk

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
899 KB
Volume
77
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tilings, packings, coverings, and the ap
Tilings, packings, coverings, and the approximation of functions
โœ Aicke Hinrichs; Christian Richter ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 279 KB

## Abstract A packing (resp. covering) โ„ฑ of a normed space __X__ consisting of unit balls is called completely saturated (resp. completely reduced) if no finite set of its members can be replaced by a more numerous (resp. less numerous) set of unit balls of __X__ without losing the packing property

Packings and coverings of the complete d
Packings and coverings of the complete directed multigraph with 3- and 4-circuits
โœ F.E. Bennett; J. Yin ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 337 KB

Let 2DK~, denote the complete directed multigraph with v vertices, where any two distinct vertices x and y are joined by 2 arcs (x,y) and 2 arcs (y,x). By a k-circuit we mean a directed cycle of length k. In this paper, we consider the problem of finding maximal packings and minimal coverings of 2DK