Login / Signup
From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs.
Miguel Angel Fiol
E. Carriga
Published in:
J. Comb. Theory, Ser. B (1997)
Keyphrases
</>
euclidean distance
graph matching
graph theoretic
strongly connected
graph theory
graph representation
distance function
distance measurement
distance matrix
graph partitioning
graph model
directed graph
high dimensional
image segmentation
graph mining
np hard
globally consistent
feature extraction
neural network