Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph.
Pawel WocjanClive ElphickPublished in: Electron. J. Comb. (2019)
Keyphrases
- lower bound
- upper bound
- spectral decomposition
- min sum
- random walk
- objective function
- graph representation
- laplacian matrix
- structured data
- graph databases
- branch and bound
- normalized cut
- optimal cost
- worst case
- bipartite graph
- graph model
- weighted graph
- graph structure
- graph theory
- learning theory
- connected components
- np hard
- directed acyclic graph
- ranked list
- lower and upper bounds
- directed graph
- graph cuts
- optimal solution