Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2016, Article ID 7863650, 6 pages
http://dx.doi.org/10.1155/2016/7863650
Research Article

On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems

Department of Discrete Analysis, P.G. Demidov Yaroslavl State University, Sovetskaya 14, Yaroslavl 150000, Russia

Received 13 August 2015; Accepted 8 December 2015

Academic Editor: Frank Werner

Copyright © 2016 Vladimir Bondarenko and Andrei Nikolaev. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979. View at MathSciNet
  2. J. Edmonds and R. M. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems,” Journal of the ACM, vol. 19, no. 2, pp. 248–264, 1972. View at Publisher · View at Google Scholar
  3. J. Hao and J. B. Orlin, “A faster algorithm for finding the minimum cut in a directed graph,” Journal of Algorithms. Cognition, Informatics and Logic, vol. 17, no. 3, pp. 424–446, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. Stoer and F. Wagner, “A simple min-cut algorithm,” Journal of the ACM, vol. 44, no. 4, pp. 585–591, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. V. A. Bondarenko and A. V. Nikolaev, “Combinatorial and geometric properties of the max-cut and min-cut problems,” Doklady Mathematics, vol. 88, no. 2, pp. 516–517, 2013. View at Google Scholar
  6. V. A. Bondarenko, “On polyhedron graph density in problems of combinatorial optimization,” Automation and Remote Control, vol. 54, no. 6, pp. 919–923, 1993. View at Google Scholar
  7. A. N. Maksimenko, “Combinatorial properties of the polyhedron associated with the shortest path problem,” Computational Mathematics and Mathematical Physics, vol. 44, no. 9, pp. 1611–1614, 2004. View at Google Scholar
  8. M. M. Deza and M. Laurent, Geometry of Cuts and Metrics, Springer, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  9. M. Ju. Moshkov, “Time complexity of decision trees,” in Transactions on Rough Sets III, J. F. Peters and A. Skowron, Eds., vol. 3400 of Lecture Notes in Computer Science, pp. 244–459, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  10. F. Barahona and A. R. Mahjoub, “On the cut polytope,” Mathematical Programming, vol. 36, no. 2, pp. 157–173, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. M. Conforti, G. Rinaldi, and L. Wolsey, “On the cut polyhedron,” Discrete Mathematics, vol. 277, no. 1–3, pp. 279–285, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. M. Skutella and A. Weber, “On the dominant of the s-t-cut polytope: vertices, facets, and adjacency,” Mathematical Programming, vol. 124, no. 1-2, pp. 441–454, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. G. O. H. Katona, “A simple proof of the Erdös-Ko-Rado theorem,” Journal of Combinatorial Theory, Series B, vol. 13, no. 2, pp. 183–184, 1972. View at Google Scholar