A characterization of maximal 2-dimensional subgraphs of transitive graphs.
Henning KoehlerPublished in: CoRR (2019)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- independent set
- graph structures
- labeled graphs
- graph data
- subgraph mining
- reachability queries
- connected subgraphs
- frequent subgraphs
- maximum common subgraph
- frequent subgraph mining
- multi dimensional
- graph theory
- graph matching
- transitive closure
- topological information
- polynomial delay
- query graph
- dense subgraphs
- graph search
- graph patterns
- directed graph
- maximum clique
- graph theoretic
- graph model
- pattern mining
- structured data
- maximal cliques
- data mining
- random graphs
- biological networks
- mining algorithm
- expressive power
- quasi cliques
- d objects