The new upper bounds on the spectral radius of weighted graphs.
Sezer SorgunSerife BüyükkösePublished in: Appl. Math. Comput. (2012)
Keyphrases
- weighted graph
- upper bound
- lower bound
- normalized cut
- shortest path
- graph partitioning
- upper and lower bounds
- lower and upper bounds
- graph structure
- regularization framework
- graph clustering
- discrete data
- data objects
- spanning tree
- learning algorithm
- edge weights
- high dimensional
- data structure
- multimedia
- machine learning
- efficiently computable
- tight upper and lower bounds