The complexity of mining maximal frequent subgraphs

Benny Kimelfeld, Phokion G. Kolaitis. The complexity of mining maximal frequent subgraphs. In Richard Hull, Wenfei Fan, editors, Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013. pages 13-24, ACM, 2013. [doi]

Abstract

Abstract is missing.