Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7064
Title: Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
Authors: Pearson, David
Vazirani, Vijay V.
Keywords: computer science
technical report
Issue Date: Aug-1991
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1224
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.
URI: http://hdl.handle.net/1813/7064
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
91-1224.pdf809.15 kBAdobe PDFView/Open
91-1224.ps206.45 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us