Results 281 to 290 of about 477,458 (300)
Some of the next articles are maybe not open access.
Approximation Algorithms for Minimum K -Cut
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nili Guttmann-Beck, Refael Hassin
openaire +1 more source
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry, 2009We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, with two specified vertices s and t, our algorithm computes a minimum (s,t)-cut in gO(g) n log n time.
Erin W. Chambers +2 more
openaire +1 more source
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
ACM Transactions on Algorithms, 2023Kyle Fox +2 more
exaly
On minimum 3-cuts and approximating k-cuts using Cut Trees
1996This paper describes two results on graph partitioning. Our first result is a non-crossing property of minimum 3-cuts. This property generalizes the results by Gomory-Hu on min-cuts (2-cute) in graphs. We also give an algorithm for finding minimum 3-cuts in O(n3) Max-Flow computations.
openaire +2 more sources
A new approach to the minimum cut problem
Journal of the ACM, 1996David R Karger, Clifford Stein
exaly
Odd Minimum Cut-Sets and b-Matchings
Mathematics of Operations Research, 1982Manfred W Padberg, M R Rao
exaly
Minimum st-cut interdiction problem
Computers and Industrial Engineering, 2020Massoud Aman, Javad Tayyebi
exaly
New algorithms for the minimum coloring cut problem
International Transactions in Operational Research, 2019Fabio Protti
exaly
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
Annals of Operations Research, 2018Francesco Carrabs +2 more
exaly