David A. Selby
IBM J. Res. Dev
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
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Conference paper
Identity delegation in policy based systems
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010