Mine 'Em All: A Note on Mining All Graphs

@inproceedings{Kuelka2015MineA,
  title={Mine 'Em All: A Note on Mining All Graphs},
  author={Ondřej Ku{\vz}elka and Jan Ramon},
  booktitle={ILP},
  year={2015}
}
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… 

References

SHOWING 1-10 OF 12 REFERENCES

Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width

The positive result of this paper provides another example of efficient pattern mining with respect to computationally intractable pattern matching operators since induced subgraph isomorphism between bounded tree-width graphs is NP-complete.

On the complexity of finding iso- and other morphisms for partial k-trees

The Complexity of Planar Graph Isomorphism

It was proved in [?] that planar graph isomorphism can be computed within logarithmic space and there is a matching hardness result [?], this shows that the problem is complete for L.

Structure theorem and isomorphism test for graphs with excluded topological subgraphs

It is proved that for a fixed H, every graph excluding H as a topological subgraph has a tree decomposition where each part is either "almost embeddable" to a fixed surface or has bounded degree with the exception of a bounded number of vertices.

Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

A fixed-parameter tractable algorithm that, given a parameter k and two graphs G, either concludes that one of these graphs has treewidth at least k, or determines whether G and G are isomorphic, which in fact solves the more general canonization problem.

The Planar Hamiltonian Circuit Problem is NP-Complete

The problem of determining whether a planar, cubic, triply-connected graph G has a Hamiltonian circuit is considered and it is shown that this problem is NP-complete.

Parameterized Complexity Theory

  • J. FlumMartin Grohe
  • Computer Science
    Texts in Theoretical Computer Science. An EATCS Series
  • 2006
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The

Efficient frequent connected subgraph mining in graphs of bounded tree-width

Graph Minors .XIII. The Disjoint Paths Problem

An algorithm, which for fixed k ≥ 0 has running time O (| V(G) | 3 ), to solve the following problem: given a graph G and k pairs of vertices of G, decide if there are k mutually vertex-disjoint paths of G joining the pairs.