Mine 'em all: a note on mining all graphs

DOI10.1007/978-3-319-40566-7_8zbMATH Open1347.68185OpenAlexW2404182091MaRDI QIDQ2827475FDOQ2827475

Authors: Ondřej Kuželka, Jan Ramon 

Publication date: 19 October 2016

Published in: Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40566-7_8

Recommendations

• The Complexity of Mining Maximal Frequent Subgraphs
• Polynomial-delay enumeration of monotonic graph classes
• Frequent Hypergraph Mining
• Efficient frequent connected subgraph mining in graphs of bounded tree-width
• Probabilistic and exact frequent subtree mining in graphs beyond forests

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Database theory (68P15)

Cites Work

• Graph minors. XIII: The disjoint paths problem
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
• On generating all maximal independent sets
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Efficient frequent connected subgraph mining in graphs of bounded tree-width

Cited In (1)

• Polynomial-delay enumeration of monotonic graph classes

This page was built for publication: Mine 'em all: a note on mining all graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827475)