Sharp upper bounds of the spectral radius of a graph.
Ji-Ming GuoZhi-Wen WangXin LiPublished in: Discret. Math. (2019)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- structured data
- graph representation
- worst case
- spectral decomposition
- normalized cut
- bipartite graph
- directed graph
- sample complexity
- graph theory
- graph structure
- lower and upper bounds
- circular arcs
- high quality
- sample size
- directed acyclic graph
- random walk
- supervised learning
- spectral methods
- tight bounds
- hyperspectral
- graph databases
- connected components
- graph cuts