Mine 'Em All: A Note on Mining All Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Mine 'Em All: A Note on Mining All Graphs

Abstract

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).
Fichier principal
Vignette du fichier
ILP2015_submission_36.pdf (368.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01321448 , version 1 (25-05-2016)

Identifiers

  • HAL Id : hal-01321448 , version 1

Cite

Ondřej Kuželka, Jan Ramon. Mine 'Em All: A Note on Mining All Graphs. 25th International Conference on Inductive Logic Programming, Katsumi Inoue, Hayato Ohwada, Akihiro Yamamoto, Aug 2015, Kyoto, Japan. ⟨hal-01321448⟩
205 View
105 Download

Share

Gmail Facebook Twitter LinkedIn More