Counting ordered graphs that avoid certain subgraphs.
László OzsvártPublished in: Discret. Math. (2016)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- graph structures
- maximum common subgraph
- reachability queries
- frequent subgraph mining
- labeled graphs
- subgraph mining
- graph data
- connected subgraphs
- dense subgraphs
- topological information
- graph patterns
- frequent subgraphs
- maximum clique
- graph theoretic
- maximal cliques
- data structure
- pattern mining
- graph matching
- graph theory
- directed graph
- graph structure
- structured data
- graph construction
- graph clustering
- bipartite graph
- social networks
- partially ordered
- biological networks
- structural information
- connected components
- graph partitioning
- graphical models
- graph model