@inproceedings{714350dd56a14a8eac18d7ebf6a1b143,
title = "A correspondence between maximal complete bipartite subgraphs and closed patterns",
abstract = "For an undirected graph G without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of G is even; (ii) that the number of the closed patterns is precisely double the number of maximal complete bipartite subgraphs of G; (iii) that for every maximal complete bipartite subgraph, there always exists a unique pair of closed patterns that matches the two vertex sets of the subgraph. Therefore, we can enumerate all maximal complete bipartite subgraphs by using efficient algorithms for mining closed patterns which have been extensively studied in the data mining field.",
author = "Jinyan Li and Haiquan Li and Donny Soh and Limsoon Wong",
year = "2005",
doi = "10.1007/11564126_18",
language = "English (US)",
isbn = "3540292446",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag",
pages = "146--156",
booktitle = "Knowledge Discovery in Databases",
note = "9th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2005 ; Conference date: 03-10-2005 Through 07-10-2005",
}