✦ LIBER ✦

Covering a set with arithmetic progressions is np-complete

✍ Scribed by Lenwood S. Health

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 470 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90013-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing triangle-free graphs with in

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete

✍ Jacobson, Michael S.; K�zdy, Andr� E.; Lehel, Jen? 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 2 views

An induced path-cycle double cover (IPCDC) of a simple graph G is a family F Å {F 1 , . . . , F k } of induced paths and cycles of G such that if F i ʝ F j x M, then F i ʝ F j is a vertex or an edge, for i x j, each edge of G appears in precisely two of the F i 's, and each vertex of G appears in pr

Operative surgery: Covering the operativ

Operative surgery: Covering the operative technique involved in the operations of general and special surgery. By Warren Stone Bickham, M.D., F.A.C.S., New York. Vol. VI and Index Volume; pp. 908, with 1224 illustrations. The whole work complete in six volumes, and free index volume. In complete sets only. London and Philadelphia: W. B. Saunders Co., Ltd. Per vol. 50s. net

📂 Article 📅 1926 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB 👁 3 views