Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs.
Jun GuoSuogang GaoPublished in: Discret. Math. (2008)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- subgraph matching
- graph properties
- labeled graphs
- graph data
- query optimization
- graph structures
- graph theoretic
- maximum common subgraph
- subgraph mining
- reachability queries
- graph patterns
- graph matching
- data structure
- directed graph
- topological information
- connected subgraphs
- query processing
- distance transform
- bipartite graph
- pattern mining
- euclidean distance
- dense subgraphs
- query graph
- quasi cliques
- distance measure
- distance function
- graph structure
- frequent subgraphs
- queueing networks