The Complexity of Mining Maximal Frequent Subgraphs

DOI10.1145/2629550zbMath1474.68106OpenAlexW2764187464MaRDI QIDQ5012510

Benny Kimelfeld, Phokion G. Kolaitis

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2629550

zbMATH Keywords

enumeration complexitygraph miningmaximal frequent subgraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Enumerating teams in first-order team logics ⋮ A distributed approach for graph mining in massive networks ⋮ A complexity theory for hard enumeration problems ⋮ Hybrid ASP-based Approach to Pattern Mining

This page was built for publication: The Complexity of Mining Maximal Frequent Subgraphs