Add to ORKGWe relate the number of minimum cuts in a weighted undi- rected graph with various structural parameters of the graph. In particular, we upper-bound the number of minimum cuts in terms of the radius, diameter, minimum degree, maximum degree, chordality, expansion, girth etc. of the graph
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
The Degree Contractibility problem is to test whether a given graph G can be modified to a graph of ...
We show that the minimumcut problem for weighted undirected graphs can be solved in NC using three s...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We prove that in an undirected graph there are at most O(n 2 ) cuts of size strictly less than 3=2...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
Abstract This paper presents a new approach to nding minimum cuts in undirected graphs. The fundamen...
Finding and counting minimum cuts in graphs can be useful in image processing and segmentation and i...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
Presented in-person and online via Bluejeans meetings on October 18, 2021 at 11:00 a.m.Anupam Gupta ...
AbstractWe give an O(nd+nlogn) algorithm computing the number of minimum (s,t)-cuts in weighted plan...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
The Degree Contractibility problem is to test whether a given graph G can be modified to a graph of ...
We show that the minimumcut problem for weighted undirected graphs can be solved in NC using three s...
We relate the number of minimum cuts in a weighted undi- rected graph with various structural param...
We relate the number of minimum cuts in a weighted undirected graph with various structural paramete...
We prove that in an undirected graph there are at most O(n 2 ) cuts of size strictly less than 3=2...
AbstractThe maximum number of cutvertices in a connected graph of order n having minimum degree at l...
AbstractA graph with n vertices and minimum degree k⩾2 can contain no more than (2k−2)n(k2−2) cut ve...
Abstract This paper presents a new approach to nding minimum cuts in undirected graphs. The fundamen...
Finding and counting minimum cuts in graphs can be useful in image processing and segmentation and i...
[[abstract]]The real-weight maximum cut of a planar graph is considered. Given an undirected planar ...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
• G = (V,E) is an undirected graph. • A cut (S, T) is a partition of V. • A cut edge is an edge with...
Presented in-person and online via Bluejeans meetings on October 18, 2021 at 11:00 a.m.Anupam Gupta ...
AbstractWe give an O(nd+nlogn) algorithm computing the number of minimum (s,t)-cuts in weighted plan...
AbstractA cut in a graph G is the set of all edges between some set of vertices S and its complement...
The Degree Contractibility problem is to test whether a given graph G can be modified to a graph of ...
We show that the minimumcut problem for weighted undirected graphs can be solved in NC using three s...