✦ LIBER ✦

Efficient algorithms for (3, 1) graphs

✍ Scribed by Ann Marie Walsh; Walter A. Burkhard

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 736 KB
Volume: 13
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(77)90009-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Efficient Algorithms for Permutatio

Some Efficient Algorithms for Permutation Graphs

✍ O.H. Ibarra; Q. Zheng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 685 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

Efficient algorithms for interval graphs

Efficient algorithms for interval graphs and circular-arc graphs

✍ U. I. Gupta; D. T. Lee; J. Y.-T. Leung 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the

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

Efficient and Constructive Algorithms fo

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

✍ Hans L. Bodlaender; Ton Kloks 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 373 KB

In this paper we give, for all constants k, l, explicit algorithms that, given a graph Ž . Gs V,E with a tree-decomposition of G with treewidth at most l, decide Ž . whether the treewidth or pathwidth of G is at most k, and, if so, find a Ž . tree-decomposition or path-decomposition of G of width at