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: ICALP (2021)
Keyphrases
- lower bound
- graph mining
- graph properties
- graph databases
- graph structures
- upper bound
- subgraph mining
- branch and bound
- frequent subgraph mining
- graph structure
- graph data
- newly developed
- topological information
- labeled graphs
- branch and bound algorithm
- directed graph
- random walk
- maximum clique
- min sum
- subgraph isomorphism
- subgraph matching
- data structure
- graph patterns
- graph theoretic
- lower and upper bounds
- graph model
- weighted graph
- query graph
- graph theory
- graph matching
- dense subgraphs
- polynomial delay
- maximal cliques
- structured data
- worst case
- image registration
- objective function