Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets

@article{Pearson1993EfficientSA,
  title={Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets},
  author={David Pearson and Vijay V. Vazirani},
  journal={J. Algorithms},
  year={1993},
  volume={14},
  pages={171-179}
}
A maximal bipartite set (MBS) in an undirected graph G = (V;E) is a maximal collection of vertices B V whose induced subgraph is bipartite. In this paper we present efficient sequential (linear time) and parallel (NC) algorithms for constructing an MBS. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

SPENCER, A New Parallel Algorithm for the Maximal Independent Set Problem

  • T. GS M. GOLDBERG
  • SIAM J. Computing
  • 1989

SUBRAMANIAN, The Complexity of Circuit Value and Network Stability, in “Proc

  • A.E.W. MAYR
  • 4th Structure in Complexity Theory,”
  • 1989

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

  • Cook S. A. C OOK
  • J . Algorithms
  • 1986

ITAI, A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

  • N. ALON, A. L. BABAI
  • J. Algorithms
  • 1986

Taxonomy of Problems with Fast Parallel Algorithms, Information and Control

  • S. A. COOK
  • 1985

WIGDERSON, A Fast Parallel Algorithm for the Maximal Independent Set Problem, in “Proc

  • A.R.M. KARP
  • 16th Annual ACM Symposium on Theory of Computing…
  • 1984

A New Parallel Algorithm for the Maximal Independent Set Problem

  • W. H. Freeman
  • SIAM J . Computing
  • 1979

TARJAN, Efficiency of a good but not linear set union algorithm

  • R E.
  • J. Assoc. Computing Mach
  • 1975

Similar Papers

Loading similar papers…