𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

✍ Scribed by D. Pearson; V.V. Vazirani

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
344 KB
Volume
14
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

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

πŸ“œ SIMILAR VOLUMES

Analysis of parallel algorithms for find
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
✍ H. Chen; A. M. Frieze πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study

Efficient and Practical Algorithms for S
Efficient and Practical Algorithms for Sequential Modular Decomposition
✍ Elias Dahlhaus; Jens Gustedt; Ross M McConnell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 214 KB

A module of an undirected graph G = V E is a set X of vertices that have the same set of neighbors in V \X. The modular decomposition is a unique decomposition of the vertices into nested modules. We give a practical algorithm with an O n + mΞ± m n time bound and a variant with a linear time bound.

Optimal and Efficient Algorithms for Sum
Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines
✍ Eunice E. Santos πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 360 KB

The problem of designing efficient parallel algorithms for summing and prefix summing for certain classes of the LogP model is studied. We present optimal algorithms for summing and show that any optimal summing algorithm must have a certain inherent structure. Moreover, we present optimal or near-o