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

Vladimir Bondarenko and Andrei Nikolaev

International Journal of Mathematics and Mathematical Sciences, 2016, vol. 2016, 1-6

Abstract:

We consider maximum and minimum cut problems with nonnegative weights of edges. We define the graphs of the cone decompositions and find a linear clique number for the min-cut problem and a superpolynomial clique number for the max-cut problem. These values characterize the time complexity in a broad class of algorithms based on linear comparisons.

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2016/7863650.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2016/7863650.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:7863650

DOI: 10.1155/2016/7863650

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().