Characterization of the cartesian product of complete graphs by convex subgraphs.
Yoshimi EgawaPublished in: Discret. Math. (1986)
Keyphrases
- cartesian product
- graph mining
- graph databases
- subgraph matching
- graph properties
- subgraph isomorphism
- connected subgraphs
- labeled graphs
- maximum common subgraph
- graph structures
- reachability queries
- graph theory
- subgraph mining
- maximum clique
- frequent subgraph mining
- query graph
- graph theoretic
- data structure
- graph data
- convex hull
- maximal cliques
- frequent subgraphs
- biological networks
- piecewise linear
- directed graph
- lower bound