Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Paper
On the number of small cuts in a graph
Abstract
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.
Related
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Conference paper
FPGA-based coprocessor for text string extraction
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000
Thomas M. Cheng
IT Professional