The performance of an eigenvalue bound on the max-cut problem in some classes of graphs.
Charles DelormeSvatopluk PoljakPublished in: Discret. Math. (1993)
Keyphrases
- max cut
- random graphs
- lower bound
- upper bound
- graph model
- algebraic structures
- worst case
- directed graph
- feature selection
- eigenvalue problems
- planar graphs
- graph clustering
- graph representation
- graph mining
- weighted graph
- bipartite graph
- graph partitioning
- graph matching
- error bounds
- class labels
- cross entropy
- multi class
- np hard
- clustering algorithm
- neural network