A bound for s-distance permutation families and explicit Ramsey graphs.
Gábor HegedüsPublished in: Australas. J Comb. (2016)
Keyphrases
- graph matching
- upper bound
- distance measure
- worst case
- error bounds
- graph databases
- lower bound
- connected graphs
- subgraph isomorphism
- graph clustering
- hamming distance
- graph mining
- distance transform
- euclidean distance
- distance function
- feature vectors
- edit distance
- graph theory
- weighted graph
- distance metric
- complex structures
- graph theoretic
- random walk
- minimum distance
- neighborhood graph
- series parallel
- data structure