On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems
Saved in:
Main Authors: | Vladimir Bondarenko, Andrei Nikolaev |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2016-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2016/7863650 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The backtrack Hölder gradient method with application to min-max and min-min problems
by: Bolte, Jérôme, et al.
Published: (2023-12-01) -
On the number of cut-vertices in a graph
by: Glenn Hopkins, et al.
Published: (1989-01-01) -
Cut by cut : editing your film or video /
by: Chandler, Gael, 1951-
Published: (2012) -
Maximum Colored Cuts in Edge-Colored Complete Graphs
by: Huawen Ma
Published: (2022-01-01) -
On the Resistance-Harary Index of Graphs Given Cut Edges
by: Hongzhuan Wang, et al.
Published: (2017-01-01)