Login / Signup
A sharp upper bound on the spectral radius of weighted graphs.
Kinkar Chandra Das
R. B. Bapat
Published in:
Discret. Math. (2008)
Keyphrases
</>
weighted graph
upper bound
lower bound
normalized cut
graph partitioning
worst case
shortest path
regularization framework
discrete data
graph structure
graph clustering
edge weights
multimedia
data streams
active learning
data objects