On the sizes of expander graphs and minimum distances of graph codes.
Tom HøholdtJørn JustesenPublished in: Discret. Math. (2014)
Keyphrases
- connected dominating set
- spanning tree
- graph representation
- graph theory
- graph structure
- dominating set
- graph matching
- graph databases
- weighted graph
- labeled graphs
- directed graph
- graph mining
- graph construction
- graph theoretic
- adjacency matrix
- graph clustering
- graph classification
- graph structures
- graph theoretical
- graph model
- graph partitioning
- subgraph isomorphism
- graph search
- minimum spanning tree
- graph properties
- graph isomorphism
- series parallel
- undirected graph
- random graphs
- graph kernels
- graph transformation
- bipartite graph
- maximum common subgraph
- edge weights
- distance measure
- structural pattern recognition
- graph drawing
- maximum distance
- graph representations
- graph data
- maximum cardinality
- distance function
- dynamic graph
- planar graphs
- euclidean distance
- attributed graphs
- maximum clique
- reachability queries
- random walk
- web graph
- inexact graph matching
- connected graphs
- quasi cliques
- graph layout
- graph patterns
- polynomial time complexity
- social graphs
- minimum cost
- neighborhood graph
- query graph
- topological information
- knn
- evolving graphs
- connected components
- dense subgraphs
- small world
- structured data
- edit distance
- vertex set