✦ LIBER ✦

A note on the complexity of a partition algorithm

✍ Scribed by Vladimir Lifschitz; Leon Pesotchinsky

Book ID: 113162553
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 260 KB
Volume: 17
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90049-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the partitioning shortest path

A note on the partitioning shortest path algorithm

✍ Martin Desrochers 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 489 KB

A note on the complexity of an algorithm

A note on the complexity of an algorithm for chebyshev approximation

✍ A. A. Goldstein 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 361 KB

Note on a partition function

✍ Manvendra Tamba 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 115 KB

A note on the complexity ofLpminimizatio

A note on the complexity ofLpminimization

✍ Dongdong Ge; Xiaoye Jiang; Yinyu Ye 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 231 KB

A note on a cycle partition problem

✍ Fengli Yang; Elkin Vumar 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Let G be any graph, and let c(G) denote the circumference of G. If, for every pair c 1 , c 2 of positive integers satisfying c 1 + c 2 = c(G), the vertex set of G admits a partition into two sets V 1 and V 2 such that V i induces a graph of circumference at most c i , i = 1, 2, then G is said to be

A note on partition coefficient distribu

A note on partition coefficient distributions

✍ Carroll, J. ;Lerche, I. 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 350 KB