The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
Authors:
- C. DelormeCDC. Delorme
- S. PoljakSPS. Poljak
- 1 February 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 111 (1-3) , 145-156
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- Eigenvalues and the max-cut problemCzechoslovak Mathematical Journal, 1990
- On Transportation Problems with Upper Bounds on Leading RectanglesSIAM Journal on Algebraic Discrete Methods, 1985
- On a Pair of Dual Subschemes of the Hamming Scheme Hn(q)European Journal of Combinatorics, 1985
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973