Maximal Biclique Subgraphs And Closed Pattern Pairs Of The Adjacency Matrix: A One-to-one Correspondence And Mining Algorithms

IEEE Computer Soc
Publication Type:
Journal Article
IEEE Transactions On Knowledge And Data Engineering, 2007, 19 (12), pp. 1625 - 1636
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010006978.pdf260.49 kB
Adobe PDF
Maximal biclique (also known as complete bipartite) subgraphs can model many applications in Web mining, business, and bioinformatics. Enumerating maximal biclique subgraphs from a graph is a computationally challenging problem, as the size of the output
Please use this identifier to cite or link to this item: