Mine ’Em All: A Note on Mining All Graphs

Conference paper

DOI: 10.1007/978-3-319-40566-7_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9575)
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).

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.School of Computer Science & InformaticsCardiff UniversityCardiffUK
  2. 2.Department of Computer ScienceKU LeuvenLeuvenBelgium
  3. 3.INRIALilleFrance

Personalised recommendations