Results 271 to 280 of about 477,458 (300)
Unifying maximum cut and minimum cut of a planar graph
IEEE Transactions on Computers, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei-Kuan Shih, Sun Wu, Yue-Sun Kuo
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM Transactions on Algorithms, 2009
For a graph ( V , E ), existing compact linear formulations for the minimum cut problem require Θ(| V || E |) variables and constraints and can be interpreted as a composition of | V | − 1 polyhedra for minimum
Göran Konjevod +2 more
exaly +3 more sources
For a graph ( V , E ), existing compact linear formulations for the minimum cut problem require Θ(| V || E |) variables and constraints and can be interpreted as a composition of | V | − 1 polyhedra for minimum
Göran Konjevod +2 more
exaly +3 more sources
Structural properties of the minimum cut of partially-supplied graphs [PDF]
Discrete Applied Mathematics, 2014 Eric A Stone
exaly +2 more sources
Minimum Cuts and Sparsification in Hypergraphs
SIAM Journal on Computing, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandra Chekuri, Chao Xu 0002
openaire +1 more source
Inverse problem of minimum cuts
Mathematical Methods of Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianzhong Zhang 0001, Mao-cheng Cai
openaire +2 more sources
An $\NC$ Algorithm for Minimum Cuts
SIAM Journal on Computing, 1997We show that the minimum-cut problem for weighted undirected graphs can be solved in $\NC$ using three separate and independently interesting results. The first is an $(m^2/n)$-processor $\NC$ algorithm for finding a $(2+\epsilon)$-approximation to the minimum cut.
David R. Karger, Rajeev Motwani 0001
openaire +1 more source
Multicriteria Global Minimum Cuts
Algorithmica, 2004We consider two multicriteria versions of the global minimum cut problem in undirected graphs In the k-criteria setting, each edge of the input graph has k non-negative costs associated with it These costs are measured in separate, non interchangeable, units In the AND-version of the problem, purchasing an edge requires the payment of all the k costs ...
Amitai Armon, Uri Zwick
openaire +1 more source
Minimum cuts and related problems
Networks, 1975AbstractThis paper is concerned with an integer programming characterization of a cut in a network. This characterization provides a fundamental equivalence between directed pseudosymmetric networks and undirected networks. It also identifies a class of problems which can be solved as minimum cut problems on a network.
Jean-Claude Picard, H. Donald Ratliff
openaire +1 more source
2014
We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained.
Barbara Geissmann, Rastislav Srámek
openaire +1 more source
We study the minimum cut problem in the presence of uncertainty and show how to apply a novel robust optimization approach, which aims to exploit the similarity in subsequent graph measurements or similar graph instances, without posing any assumptions on the way they have been obtained.
Barbara Geissmann, Rastislav Srámek
openaire +1 more source
2017
We show how to compute the minimum cut of a graph cache-efficiently. Let B be the width of a cache line and M be the size of the cache. On a graph with V vertices and E edges, we give a cache oblivious algorithm that incurs \(O(\lceil \frac{E}{B} (\log ^4 E) \log _{M/B} E\rceil )\) cache misses and a simpler one that incurs \(O(\lceil \frac{V^2}{B ...
Barbara Geissmann, Lukas Gianinazzi
openaire +1 more source
We show how to compute the minimum cut of a graph cache-efficiently. Let B be the width of a cache line and M be the size of the cache. On a graph with V vertices and E edges, we give a cache oblivious algorithm that incurs \(O(\lceil \frac{E}{B} (\log ^4 E) \log _{M/B} E\rceil )\) cache misses and a simpler one that incurs \(O(\lceil \frac{V^2}{B ...
Barbara Geissmann, Lukas Gianinazzi
openaire +1 more source