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

Efficient bipartitioning algorithm for size-constrained circuits

โœ Scribed by Cherng, J.-S.; Chen, S.-J.; Ho, J.-M.

Book ID
114448321
Publisher
The Institution of Electrical Engineers
Year
1998
Tongue
English
Weight
998 KB
Volume
145
Category
Article
ISSN
1350-2387

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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 Sequential and Parallel Algori
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
โœ D. Pearson; V.V. Vazirani ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

A maximal bipartite set (MBS) in an undirected graph \(G=(V, E)\) is a maximal collection of vertices \(B \subseteq V\) whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS. 1.1993 Acatemic Press, Inc