Cheeger’s cut, maxcut and the spectral theory of 1-Laplacian on graphs
- 8 August 2017
- journal article
- research article
- Published by Springer Nature in Science China Mathematics
- Vol. 60 (11) , 1963-1980
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The 1-Laplacian Cheeger Cut: Theory and AlgorithmsJournal of Computational Mathematics, 2018
- Nodal domains of eigenvectors for 1-Laplacian on graphsAdvances in Mathematics, 2017
- Spectrum of the 1-Laplacian and Cheeger's Constant on GraphsJournal of Graph Theory, 2015
- Bipartite and neighborhood graphs and the spectrum of the normalized graph Laplace operatorCommunications in Analysis and Geometry, 2013
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problemMathematical Programming, 2009
- Laplacian Eigenvectors of Graphs2007
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic ProgramsSIAM Journal on Optimization, 2002
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Laplacian eigenvalues and the maximum cut problemMathematical Programming, 1993
- Variational methods for non-differentiable functionals and their applications to partial differential equationsJournal of Mathematical Analysis and Applications, 1981