✦ LIBER ✦

Parallel algorithms for permutation graphs

✍ Scribed by Chang-Wu Yu; Gen-Huey Chen

Book ID: 105429120
Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 365 KB
Volume: 33
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01990525

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A compact data structure and parallel algorithms for permutation graphs

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 383 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

An Optimal Shortest Path Parallel Algori

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f

Sequential and parallel algorithms for t

Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

An optimal EREW parallel algorithm for c

An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs

✍ H.S. Chao; F.R. Hsu; R.C.T. Lee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Given a undirected graph G, the breadth-first search tree is constructed by a breadth-first search on G. In this paper, an optimal parallel algorithm is presented for constructing the breadth-first search tree for permutation graphs in O(log n) time by using O(n/Iog n) processors under the EREW PRAM