Show simple item record

dc.contributor.authorPearson, Daviden_US
dc.contributor.authorVazirani, Vijay V.en_US
dc.date.accessioned2007-04-23T17:54:36Z
dc.date.available2007-04-23T17:54:36Z
dc.date.issued1991-08en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1224en_US
dc.identifier.urihttps://hdl.handle.net/1813/7064
dc.description.abstractA 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.en_US
dc.format.extent828574 bytes
dc.format.extent211408 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleEfficient Sequential and Parallel Algorithms for Maximal Bipartite Setsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics