Laplacian eigenvalues and the maximum cut problem
- 1 February 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 62 (1-3), 557-574
- https://doi.org/10.1007/bf01585184
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Combinatorial Properties and the Complexity of a Max-cut ApproximationEuropean Journal of Combinatorics, 1993
- The performance of an eigenvalue bound on the max-cut problem in some classes of graphsDiscrete Mathematics, 1993
- Compositions in the bipartite subgraph polytopeDiscrete Mathematics, 1992
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout DesignOperations Research, 1988
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- On Transportation Problems with Upper Bounds on Leading RectanglesSIAM Journal on Algebraic Discrete Methods, 1985
- On some weakly bipartite graphsOperations Research Letters, 1983
- Lower Bounds for the Partitioning of GraphsIBM Journal of Research and Development, 1973
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973