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={International Conference on Inductive Logic Programming},
  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 13 REFERENCES

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

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.

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.

Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)

The study reveals for example that an unexpected combination of bounded degree, genus, and feedback vertex set number of $G$ gives rise to a highly nontrivial algorithm for Subgraph Isomorphism.

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.

Isomorphism of graphs of bounded valence can be tested in polynomial time

  • E. Luks
  • Mathematics
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
Testing isomorphism of graphs of valence ≤ t is polynomial-time reducible to the color automorphism problem for groups with small simple sections, and some results on primitive permutation groups are used to show that the algorithm runs inPolynomial time.

On Generating All Maximal Independent Sets

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.