Invention Grant
US08209742B2 Computer-implemented method for obtaining a minimum biclique cover in a bipartite dataset
有权
用于在二分数据集中获得最小双面覆盖的计算机实现方法
- Patent Title: Computer-implemented method for obtaining a minimum biclique cover in a bipartite dataset
- Patent Title (中): 用于在二分数据集中获得最小双面覆盖的计算机实现方法
-
Application No.: US12350130Application Date: 2009-01-07
-
Publication No.: US08209742B2Publication Date: 2012-06-26
- Inventor: Robert S. Schreiber , Alina Ene , Nikola Milosavljevic , Robert E. Tarjan , Mehul A. Shah
- Applicant: Robert S. Schreiber , Alina Ene , Nikola Milosavljevic , Robert E. Tarjan , Mehul A. Shah
- Applicant Address: US TX Houston
- Assignee: Hewlett-Packard Development Company, L.P.
- Current Assignee: Hewlett-Packard Development Company, L.P.
- Current Assignee Address: US TX Houston
- Main IPC: H04L29/06
- IPC: H04L29/06

Abstract:
A method includes providing a bipartite graph having vertices of a first type, vertices of a second type, and a plurality of edges, wherein each edge joins a vertex of the first type with a vertex of the second type. A unipartite edge dual graph is generated from the bipartite graph, and a minimum clique partition of the edge dual graph is recursively determined. A biclique is then created in the bipartite graph corresponding to each clique in the minimum clique partition of the edge dual graph.
Public/Granted literature
- US20100175111A1 Computer-Implemented Method for Obtaining a Minimum Biclique Cover in a Bipartite Dataset Public/Granted day:2010-07-08
Information query