Return to search

Fast algorithms for finding the maximum edge cardinality biclique in convex bipartite graphs /

Thesis (M. Sc.)--Carleton University, 2004. / Includes bibliographical references (p. 95-99). Also available in electronic format on the Internet.

Identiferoai:union.ndltd.org:OCLC/oai:xtcat.oclc.org:OCLCNo/290649817
Date January 1900
CreatorsPu, Shuye,
PublisherOttawa,
Source SetsOCLC
LanguageEnglish
Detected LanguageEnglish
SourceProQuest Full Text

Page generated in 0.002 seconds