๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient Parallel Algorithms for Planarst-Graphs

โœ Scribed by Mikhail J. Atallah, Danny Z. Chen and Ovidiu Daescu

Book ID
120136571
Publisher
Springer
Year
2003
Tongue
English
Weight
136 KB
Volume
35
Category
Article
ISSN
0178-4617

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

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

Efficient Parallel Algorithms for Graphs
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
โœ Jens Lagergren ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

We present an efficient parallel algorithm for the tree-decomposition problem ลฝ 3 . ลฝ. for fixed width w. The algorithm runs in time O O log n and uses O O n processors on an ARBITRARY CRCW PRAM. The sequential complexity of our tree-decom-ลฝ 2 . position algorithm is O O n log n . The tree-decomposi

Parallel algorithms for parity graphs
Parallel algorithms for parity graphs
โœ T Przytycka; D.G Corneil ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 782 KB