Add to ORKGWe prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\frac{3}{2}$ the size of the minimum cut
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
We study the solution quality for min-cut problems on graphs when restricting the shapes of the allo...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
We prove that in an undirected graph there are at most O(n 2 ) cuts of size strictly less than 3=2...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
13 pages, 10 figures, full version of the paper accepted in WG 2019The parameterized complexity of c...
Abstract This paper presents a new approach to nding minimum cuts in undirected graphs. The fundamen...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
Let $G = (V,w)$ be a weighted undirected graph with $m$ edges. The cut dimension of $G$ is the dime...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
We study the number of inclusion-minimal cuts in an undirected connected graph G, also called {\$}{\...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
We study the solution quality for min-cut problems on graphs when restricting the shapes of the allo...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...
We prove that in an undirected graph there are at most O(n 2 ) cuts of size strictly less than 3=2...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
13 pages, 10 figures, full version of the paper accepted in WG 2019The parameterized complexity of c...
Abstract This paper presents a new approach to nding minimum cuts in undirected graphs. The fundamen...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
AbstractFor given integers n and D, what is the minimum number of edges in a graph on n vertices wit...
Let $G = (V,w)$ be a weighted undirected graph with $m$ edges. The cut dimension of $G$ is the dime...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
We study the number of inclusion-minimal cuts in an undirected connected graph G, also called {\$}{\...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
We study the solution quality for min-cut problems on graphs when restricting the shapes of the allo...
AbstractIt is proved that, if n is sufficiently large compared with d, then the smallest number of e...