Loading...
research article
On the number of small cuts in a graph
We prove that in an undirected graph there are at most O(n2) cuts of size strictly less than 3/2 of the size of the minimum cut.
Type
research article
Scopus ID
2-s2.0-0040203288
Authors
Publication date
1996
Published in
Volume
59
Issue
1
Start page
41
End page
44
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 18, 2007
Use this identifier to reference this record