Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes.
Mark GinnPublished in: J. Graph Theory (1999)
Keyphrases
- graph mining
- graph databases
- graph properties
- graph data
- graph classification
- subgraph matching
- maximum weight
- labeled graphs
- maximum matching
- frequent subgraph mining
- subgraph isomorphism
- frequent subgraphs
- subgraph mining
- connected subgraphs
- query graph
- dense subgraphs
- pattern mining
- maximum clique
- directed graph
- graph theoretic
- equivalence classes
- stable set
- similarity graph
- graph kernels
- graph structures
- np hard
- random walk
- structured data
- connected components
- graph theory
- bipartite graph
- search space
- query language
- semi supervised
- graph structure
- graph representation
- edge weights
- clustering algorithm
- graph patterns
- minimum weight
- graph search