✦ LIBER ✦

A parallel algorithm for the maximum 2-chain edge packing problem

✍ Scribed by Shuji Shiraishi

Book ID: 107765857
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 390 KB
Volume: 32
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90018-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel algorithms for the maximum

Fast parallel algorithms for the maximum sum problem

✍ Zhaofang Wen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 414 KB

A Fast Algorithm for the Path 2-Packing

A Fast Algorithm for the Path 2-Packing Problem

✍ Maxim A. Babenko 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 668 KB

An exact bit-parallel algorithm for the

An exact bit-parallel algorithm for the maximum clique problem

✍ Pablo San Segundo; Diego Rodríguez-Losada; Agustín Jiménez 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 671 KB

Parallel Algorithms for the Edge-Colorin

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems

✍ Weifa Liang; Xiaojun Shen; Qing Hu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ ϩ 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ ϩ 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Յ 3⌬/2 [16]. A number of parallel algorithms

Algorithm for the vertex packing problem

✍ Yu. V. Voitishin; E. A. Sharkovskaya 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 184 KB

Fast parallel algorithms for the approxi

Fast parallel algorithms for the approximate edge-coloring problem

✍ Weifa Liang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 524 KB