A characterization of the Hamming graph by strongly closed subgraphs.
Akira HirakiPublished in: Eur. J. Comb. (2008)
Keyphrases
- graph properties
- graph databases
- graph mining
- graph data
- labeled graphs
- subgraph mining
- graph structures
- query graph
- data structure
- frequent subgraph mining
- maximum clique
- random walk
- structured data
- topological information
- subgraph isomorphism
- directed graph
- connected subgraphs
- reachability queries
- frequent subgraphs
- graph theory
- graph structure
- graph theoretic
- graph model
- graph search
- queueing networks
- graph representation
- subgraph matching
- graph matching
- bipartite graph
- directed acyclic graph
- graph patterns
- hamming distance
- graph based algorithm
- connected components
- dense subgraphs
- closure operator
- similarity measure
- weighted graph
- relational data
- graph kernels