A Perturbation-Based Duality Classification for Max-Flow Min-Cut Problems of Strang and Iri

2020 ◽  
pp. 285-303
Author(s):  
Ryôhei Nozawa ◽  
K. O. Kortanek
Keyword(s):  
Cut Problems ◽  
Min Cut

scholarly journals Potential method of nonlinear resistive circuits to solve max-flow/min-cut problems

2016 ◽  
Vol 7 (4) ◽  
pp. 509-522
Author(s):  
Masatoshi Sato ◽  
Hisashi Aomori ◽  
Tsuyoshi Otake ◽  
Mamoru Tanaka
Keyword(s):  
Potential Method ◽  
Cut Problems ◽  
Min Cut

scholarly journals Complexity of the min–max (regret) versions of min cut problems

2008 ◽  
Vol 5 (1) ◽  
pp. 66-73 ◽  
Author(s):  
Hassene Aissi ◽  
Cristina Bazgan ◽  
Daniel Vanderpooten
Keyword(s):  
Cut Problems ◽  
Min Cut

Combinatorial and geometric properties of the Max-Cut and Min-Cut problems

2013 ◽  
Vol 88 (2) ◽  
pp. 516-517 ◽  
Author(s):  
V. A. Bondarenko ◽  
A. V. Nikolaev
Keyword(s):  
Geometric Properties ◽  
Cut Problems ◽  
Min Cut

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

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Vladimir Bondarenko ◽  
Andrei Nikolaev
Keyword(s):  
Time Complexity ◽  
Broad Class ◽  
Clique Number ◽  
Minimum Cut ◽  
Max Cut Problem ◽  
Cut Problems ◽  
Min Cut

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.

Novel Voltage Choice and Min-Cut Based Assignment for Dual-VDD System

2012 ◽  
Vol E95.A (12) ◽  
pp. 2208-2219 ◽  
Author(s):  
Haiqi WANG ◽  
Sheqin DONG ◽  
Tao LIN ◽  
Song CHEN ◽  
Satoshi GOTO
Keyword(s):  
Min Cut
Sign in / Sign up

Export Citation Format

Share Document