Strongly distance-balanced graphs and graph products.
Kannan BalakrishnanManoj ChangatIztok PeterinSimon SpacapanPrimoz SparlAjitha R. SubhamathiPublished in: Eur. J. Comb. (2009)
Keyphrases
- graph representation
- weighted graph
- graph structure
- graph construction
- graph theory
- graph matching
- graph theoretic
- edge weights
- adjacency matrix
- labeled graphs
- directed graph
- graph search
- graph databases
- neighborhood graph
- graph mining
- graph model
- graph structures
- graph classification
- graph clustering
- graph properties
- bipartite graph
- graph theoretical
- subgraph isomorphism
- random graphs
- series parallel
- graph representations
- graph isomorphism
- graph partitioning
- undirected graph
- spanning tree
- graph transformation
- graph data
- dynamic graph
- directed acyclic
- maximum cardinality
- structural pattern recognition
- inexact graph matching
- minimum spanning tree
- graph embedding
- maximum independent set
- disk resident
- distance measure
- distance function
- graph layout
- reachability queries
- random walk
- proximity graph
- graph kernels
- adjacency graph
- graph drawing
- finding the shortest path
- maximum common subgraph
- knn
- query graph
- maximum clique
- polynomial time complexity
- connected graphs
- planar graphs
- social networks
- structured data
- euclidean distance
- web graph
- graph patterns
- quasi cliques
- massive graphs
- bounded treewidth
- topological information
- dense subgraphs
- strongly connected
- attributed graphs
- association graph
- vertex set
- average degree