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

On the Existence of Completely Saturated Packings and Completely Reduced Coverings

โœ Scribed by Lewis Bowen

Book ID
111538913
Publisher
Springer
Year
2003
Tongue
English
Weight
168 KB
Volume
98
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On existence of complete sets for bounde
On existence of complete sets for bounded reducibilities
โœ Valeriy Bulitko; Vadim Bulitko ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 165 KB

## Abstract Classical reducibilities have complete sets __U__ that any recursively enumerable set can be reduced to __U__. This paper investigates existence of complete sets for reducibilities with limited oracle access. Three characteristics of classical complete sets are selected and a natural hi

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