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

Some Efficient Algorithms for Permutation Graphs

โœ Scribed by O.H. Ibarra; Q. Zheng

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
685 KB
Volume
16
Category
Article
ISSN
0196-6774

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

Some Algorithms for Nilpotent Permutatio
Some Algorithms for Nilpotent Permutation Groups
โœ Eugene M. Luks; Ferenc Rรกkรณczi; Charles R.B. Wright ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 727 KB

Let G, H and E be subgroups of a finite nilpotent permutation group of degree n. We describe the theory and implementation of an algorithm to compute the normalizer N G (H) in time polynomial in n, and we give a modified algorithm to determine whether H and E are conjugate under G and, if so, to fin

Efficient algorithms for (3, 1) graphs
Efficient algorithms for (3, 1) graphs
โœ Ann Marie Walsh; Walter A. Burkhard ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 736 KB