Login / Signup
A note on upper bounds for the spectral radius of weighted graphs.
Gui-Xian Tian
Ting-Zhu Huang
Published in:
Appl. Math. Comput. (2014)
Keyphrases
</>
weighted graph
upper bound
lower bound
normalized cut
upper and lower bounds
shortest path
graph partitioning
lower and upper bounds
data objects
graph structure
regularization framework
discrete data
edge weights
graph clustering
efficiently computable
tight upper and lower bounds