Tight Bounds for Finding Degrees from the Adjacency Matrix.

R. Balasubramanian Venkatesh Raman G. Srinivasaraghavan

Published in: LATIN (1995)

Keyphrases

tight bounds
adjacency matrix
upper bound
graph representation
graph matching
weighted graph
graph edit distance
eigenvalues and eigenvectors
graph model
graph clustering
lower bound
pattern recognition
computer vision
directed graph
edit distance
language model
graph partitioning
multiscale