Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
Pearson, David; Vazirani, Vijay V.
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.
computer science; technical report
Previously Published As