Login / Signup
On the bounds for the largest Laplacian eigenvalues of weighted graphs.
Sezer Sorgun
Serife Büyükköse
Published in:
Discret. Optim. (2012)
Keyphrases
</>
weighted graph
graph laplacian
laplacian matrix
shortest path
graph structure
covariance matrix
graph clustering
data objects
discrete data
regularization framework
principal component analysis
training data
pairwise