Weighted enumeration of spanning subgraphs in locally tree-like graphs.
Justin SalezPublished in: Random Struct. Algorithms (2013)
Keyphrases
- reachability queries
- maximal cliques
- maximal clique enumeration
- graph mining
- graph databases
- association graph
- subgraph isomorphism
- maximum clique
- weighted graph
- subgraph matching
- graph properties
- spanning tree
- graph structures
- graph structure
- maximum common subgraph
- graph theory
- labeled graphs
- subgraph mining
- connected subgraphs
- tree nodes
- minimum spanning tree
- graph data
- tree structure
- graph model
- data objects
- graph matching
- index structure
- graph theoretic
- maximum weight
- graph patterns
- frequent subgraph mining
- tree structured data
- tree structures
- graph partitioning
- topological information
- pattern mining
- edge weights
- frequent subgraphs
- structured data
- dense subgraphs
- polynomial delay
- graph search
- spectral graph
- data structure
- search algorithm