Mine ’Em All: A Note on Mining All Graphs

DOI10.1007/978-3-319-40566-7_8zbMath1347.68185OpenAlexW2404182091MaRDI QIDQ2827475

Jan Ramon, Ondřej Kuželka

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

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Mine ’Em All: A Note on Mining All Graphs