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.
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/1nzCycE
via IFTTT
Εγγραφή σε:
Σχόλια ανάρτησης (Atom)
Δημοφιλείς αναρτήσεις
-
Objectives To optimise medical students’ early clerkship is a complex task since it is conducted in a context primarily organised to take ca...
-
Abstract Purpose Overcoming the flaws of current data management conditions in head and neck oncology could enable integrated informatio...
-
1 abqls-210rm.html Read the latest Journal of Clinical Neurophysiology - Vol. 37, No. 1, January 2020.eml 2 agx3v-nxz96.html Read the late...
-
by Yanwei Li, Haifeng Liu, Wei Zeng, Jing Wei An increase in the osmolarity of tears induced by excessive evaporation of the aqueous tear p...
-
http://ift.tt/2p41efZ
-
Abstract Bromodomain proteins function as epigenetic readers that recognize acetylated histone tails to facilitate the transcription of t...
-
Abstract In present work, the electronic structure and optical properties of the FeX 2 (X = S, Se, Te) compounds have been evaluated by t...
-
by Rocio Acuna-Hidalgo, Pelagia Deriziotis, Marloes Steehouwer, Christian Gilissen, Sarah A. Graham, Sipko van Dam, Julie Hoover-Fong, Aida...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου