Mine ’Em All: A Note on Mining All Graphs
- Cite this paper as:
- Kuželka O., Ramon J. (2016) Mine ’Em All: A Note on Mining All Graphs. In: Inoue K., Ohwada H., Yamamoto A. (eds) Inductive Logic Programming. ILP 2015. Lecture Notes in Computer Science, vol 9575. Springer, Cham
We study the complexity of the problem of enumerating all graphs with frequency at least 1 and computing their support. We show that there are hereditary classes of graphs for which the complexity of this problem depends on the order in which the graphs should be enumerated (e.g. from frequent to infrequent or from small to large). For instance, the problem can be solved with polynomial delay for databases of planar graphs when the enumerated graphs should be output from large to small but it cannot be solved even in incremental-polynomial time when the enumerated graphs should be output from most frequent to least frequent (unless P=NP).