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

Edge domination on bipartite permutation graphs and cotriangulated graphs

โœ Scribed by Anand Srinivasan; K. Madhukar; P. Nagavamsi; C.Pandu Rangan; Maw-Shang Chang

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
638 KB
Volume
56
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Permutation graphs: Connected domination
Permutation graphs: Connected domination and Steiner trees
โœ Charles J. Colbourn; Lorna K. Stewart ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 702 KB

Efficient algorithms are developed for finding a minimum cardinality connected dominating set and a minimum cardinality Steiner tree in permutation graphs. This contrasts with the known NP-completeness of both problems on comparability graphs in general.

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