Detecting and Counting Small Subgraphs, and Evaluating a Parameterized Tutte Polynomial: Lower Bounds via Toroidal Grids and Cayley Graph Expanders.
Marc RothJohannes SchmittPhilip WellnitzPublished in: CoRR (2020)
Keyphrases
- lower bound
- graph databases
- graph mining
- graph properties
- upper bound
- labeled graphs
- random walk
- subgraph isomorphism
- subgraph mining
- graph structures
- reachability queries
- min sum
- graph theory
- newly developed
- graph model
- graph data
- graph structure
- topological information
- frequent subgraph mining
- connected subgraphs
- objective function
- graph theoretic
- quasi cliques
- branch and bound
- data structure
- polynomial delay
- weighted graph
- subgraph matching
- np hard
- branch and bound algorithm
- vc dimension
- directed graph
- search algorithm
- structured data
- pattern mining
- connected components
- graph matching
- frequent subgraphs
- bipartite graph
- spanning tree
- lower and upper bounds