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)
Δημοφιλείς αναρτήσεις
-
Family: Know the drill New Straits Times Online One of my sons had this so often that his tonsils were removed. ... However, for som...
-
UM-Chor1: establishment and characterization of the first validated clival chordoma cell line. J Neurosurg. 2017 Apr 21;:1-9 Authors:...
-
Publication date: Available online 10 May 2017 Source: Journal of Dairy Science Author(s): R.E. Vibart, M. Tavendale, D. Otter, B.H. Schw...
-
Abstract Cerebral and systemic organ microvascular pathologies coexist with human Alzheimer’s disease (AD) neuropathology. In this study, w...
-
Related Articles Developmental control of macrophage function. Curr Opin Immunol. 2017 Dec 13;50:64-74 Authors: Bonnardel J, Guillia...
-
Description A Caucasian boy aged 5 years presented with acute onset of a non-tender, palpable purpuric rash to his lower limbs, preceded by ...
-
Purpose. Sinonasal malignant mucosal melanoma is a rare, aggressive tumour. Nasal obstruction and epistaxis are the most commonly reported s...
-
Abstract Conquering immunosuppression in tumor microenvironments is crucial for effective cancer immunotherapy. It is well known that inte...
-
Abstract: Epidermolytic ichthyosis (EI) is a rare disorder of cornification caused by mutations in KRT1 and KRT10, encoding two suprabasal e...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου