Lattices generated by strongly closed subgraphs in d-bounded distance-regular graphs.
Suogang GaoJun GuoWen LiuPublished in: Eur. J. Comb. (2007)
Keyphrases
- graph mining
- graph databases
- labeled graphs
- graph structures
- subgraph matching
- subgraph isomorphism
- maximum common subgraph
- reachability queries
- distance measure
- graph properties
- graph data
- distance function
- subgraph mining
- connected subgraphs
- euclidean distance
- frequent subgraph mining
- query graph
- graph structure
- graph theory
- graph matching
- data structure
- dense subgraphs
- automatically generated
- spanning tree
- topological information
- frequent subgraphs
- graph search
- graph construction
- graph patterns
- small world