Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference28 articles.
1. F. Barahona, On the complexity of Max Cut, Rapport de recherche 186, 1980. IMAG, Université Joseph Fourier, Grenoble, France.
2. The max-cut problem on graphs not contractible to K5;Barahona;Operations Research Letters,1983
3. On the cut polytope;Barahona;Mathematical Programming,1986
4. Erratum to minimal multicut and maximal integer multiflow: a survey;Bentz;European Journal of Operational Research,2007
5. Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs;Bentz;Journal of Discrete Algorithms,2007
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献