Computer-implemented method for obtaining a minimum biclique cover in a bipartite dataset
US8209742B2 · kind B2 · utility
24Cited by
3References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jan 7, 2009 |
| Grant date | Jun 26, 2012 |
| Priority date | — |
| Expiry date | Jan 31, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/10
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.