College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets|
|Authors: ||Pearson, David|
Vazirani, Vijay V.
|Keywords: ||computer science|
|Issue Date: ||Aug-1991|
|Publisher: ||Cornell University|
|Abstract: ||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.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.