✦ LIBER ✦

Optimum partitioning of a sequence of elements into subsequences

✍ Scribed by T. K. Vintsyuk

Publisher: Springer US
Year: 1973
Tongue: English
Weight: 462 KB
Volume: 6
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073253

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning a sequence into few monoton

Partitioning a sequence into few monotone subsequences

✍ Reuven Bar Yehuda; Sergio Fogel 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 329 KB

Optimum partitioning into intersections

Optimum partitioning into intersections of ring families

✍ Maurice Cochand; Arlette Gaillard; Heinz Gröflin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 680 KB

An optimum design of elements introducin

An optimum design of elements introducing a load into a spherical shell

✍ Stanisław A. Łukasiewicz; Witold Borajkiewicz 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 555 KB

On the ideal convergence of subsequences

On the ideal convergence of subsequences and rearrangements of a real sequence

✍ Hüseyin Albayrak; Serpil Pehli̇van 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Partitioning a graph into defensivek-all

Partitioning a graph into defensivek-alliances

✍ Ismael G. Yero; Sergio Bermudo; Juan A. Rodríguez-Velázquez; José M. Sigarreta 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB

Partitioning Vertices of a Tournament in

Partitioning Vertices of a Tournament into Independent Cycles

✍ Guantao Chen; Ronald J. Gould; Hao Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

Let k be a positive integer. A strong digraph G is termed k-connected if the removal of any set of fewer than k vertices results in a strongly connected digraph. The purpose of this paper is to show that every k-connected tournament with at least 8k vertices contains k vertex-disjoint directed cycle