✦ LIBER ✦

Coloring permutation graphs in parallel

✍ Scribed by Stavros D. Nikolopoulos

Book ID: 108498092
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 51 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80044-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring planar graphs in parallel

✍ Joan F Boyar; Howard J Karloff 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 616 KB

Parallel algorithms for permutation grap

Parallel algorithms for permutation graphs

✍ Chang-Wu Yu; Gen-Huey Chen 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 365 KB

Efficient Parallel Algorithms for Permut

Efficient Parallel Algorithms for Permutation Graphs

✍ K. Arvind; V. Kamakoti; C.P. Rangan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 641 KB

In this paper, we present optimal \(O(\log n)\) time, \(O(n / \log n)\) processor EREW PRAM parallel algorithms for finding the connected components, cut vertices, and bridges of a permutation graph. We also present an \(O(\log n)\) time, \(O(n)\) processor, CREW PRAM model parallel algorithm for fi

The Entire Coloring of Series-Parallel G

The Entire Coloring of Series-Parallel Graphs

✍ Jian-liang Wu; Yu-liang Wu 📂 Article 📅 2005 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 246 KB

Efficient parallel algorithms for bipart

Efficient parallel algorithms for bipartite permutation graphs

✍ Lin Chen; Yaacov Yesha 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 858 KB

## Abstract In this paper, we further study the properties of bipartite permutation graphs. We give first efficient parallel algorithms for several problems on bipartite permutation graphs. These problems include transforming a bipartite graph into a strongly ordered one if it is also a permutation

Parallel (Δ + 1)-coloring of constant-de

Parallel (Δ + 1)-coloring of constant-degree graphs

✍ Andrew V. Goldberg; Serge A. Plotkin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 364 KB