Lower bounds for the Laplacian spectral radius of an oriented hypergraph.
Ouail KitouniNathan ReffPublished in: Australas. J Comb. (2019)
Keyphrases
- lower bound
- spectral decomposition
- upper bound
- np hard
- branch and bound
- branch and bound algorithm
- high order
- lower and upper bounds
- objective function
- higher order
- pairwise
- lower bounding
- upper and lower bounds
- laplacian matrix
- vc dimension
- spectral analysis
- hypergraph model
- worst case
- sparse coding
- low dimensional
- spectral features
- optimal cost
- edge detection
- min sum
- scheduling problem