How to Find overfull Subgraphs in Graphs with Large Maximum Degree.
Thomas NiessenPublished in: Discret. Appl. Math. (1994)
Keyphrases
- graph mining
- graph databases
- graph properties
- subgraph isomorphism
- subgraph matching
- labeled graphs
- graph structures
- maximum common subgraph
- graph data
- reachability queries
- connected subgraphs
- random graphs
- maximum clique
- query graph
- subgraph mining
- topological information
- dense subgraphs
- frequent subgraph mining
- graph theory
- quasi cliques
- graph theoretic
- graph matching
- pattern mining
- frequent subgraphs
- graph patterns
- weighted graph
- bipartite graph
- clustering coefficient
- data structure
- graph clustering
- regular expressions
- directed graph
- power law
- directed acyclic graph