Hamming dimension of a graph - The case of Sierpiński graphs.
Sandi KlavzarIztok PeterinSara Sabrina ZemljicPublished in: Eur. J. Comb. (2013)
Keyphrases
- graph databases
- graph representation
- graph theoretic
- graph theory
- weighted graph
- graph clustering
- graph structures
- graph matching
- graph structure
- graph model
- directed graph
- graph mining
- labeled graphs
- random graphs
- graph data
- graph partitioning
- subgraph isomorphism
- graph construction
- adjacency matrix
- series parallel
- undirected graph
- graph theoretical
- spanning tree
- graph classification
- structured data
- graph search
- minimum spanning tree
- dense subgraphs
- graph kernels
- graph transformation
- directed acyclic
- graph drawing
- disk resident
- finding the shortest path
- fully connected
- graph isomorphism
- graph properties
- bipartite graph
- maximum clique
- graph representations
- planar graphs
- reachability queries
- structural pattern recognition
- connected graphs
- real world graphs
- average degree
- dynamic graph
- shortest path
- web graph
- maximum common subgraph