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

An efficient algorithm for bipartite PLA folding

โœ Scribed by Chun-Yeh Liu; Saluja, K.K.

Book ID
119777728
Publisher
IEEE
Year
1993
Tongue
English
Weight
906 KB
Volume
12
Category
Article
ISSN
0278-0070

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Exact Algorithm for Constra
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
โœ Henning Fernau; Rolf Niedermeier ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 382 KB

The constraint bipartite vertex cover problem (CBVC for short) is as follows: given a bipartite graph G with n vertices and two positive integers k 1 k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It fo

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