Reconstructing subgraph-counting graph polynomials of increasing families of graphs.
Bostjan BresarWilfried ImrichSandi KlavzarPublished in: Discret. Math. (2005)
Keyphrases
- graph databases
- graph properties
- labeled graphs
- graph mining
- graph classification
- graph data
- subgraph isomorphism
- dense subgraphs
- query graph
- subgraph matching
- directed graph
- graph theoretic
- frequent subgraph mining
- graph search
- subgraph mining
- frequent subgraphs
- connected subgraphs
- weighted graph
- graph representation
- graph matching
- graph structures
- maximum clique
- graph theory
- graph kernels
- graph isomorphism
- graph structure
- graph model
- bipartite graph
- maximum common subgraph
- pattern mining
- graph clustering
- graph construction
- edge weights
- structured data
- structural pattern recognition
- series parallel
- graph partitioning
- community discovery
- random graphs
- maximum matching
- web graph
- real world graphs
- maximum weight
- adjacency matrix
- graph patterns
- graph representations
- graph theoretical
- regular expressions
- connected components
- neighborhood graph
- undirected graph
- planar graphs
- directed acyclic graph
- reachability queries
- relational data
- maximal cliques
- quasi cliques
- random walk