𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On opposition graphs, coalition graphs, and bipartite permutation graphs

✍ Scribed by Le, Van Bang

Book ID
123492797
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
269 KB
Volume
168
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite permutation graphs
Bipartite permutation graphs
✍ Jeremy Spinrad; Andreas BrandstΓ€dt; Lorna Stewart πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 912 KB

This paper examines the class ofbipartite permutation graphs. Two chaiacterizations of graphs i n this class are presented. These characterizations l ead to a linear time recognition algorithm, and to polynomial time algorithms for a number of NP-complete problems when restricted to graphs i n this

Bipartite Graphs, Hamiltonicity and grap
Bipartite Graphs, Hamiltonicity and graphs
✍ Rahman, M. Sohel; Kaykobad, M.; Kaykobad, Md. Tanvir πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 182 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