Information Processing Letters

Paper

08 Jul 1996

On the number of small cuts in a graph

View publication

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

Conference paper

A quantitative analysis of OS noise

Alessandro Morari, Roberto Gioiosa, et al.

IPDPS 2011

Conference paper

An Arabic Slot Grammar parser

Michael C. McCord, Violetta Cavalli-Sforza

ACL 2007

Review

Data aggregation architectures for single-chip SDH/SONET framers

Rolf Clauberg

IBM J. Res. Dev

Paper

Routing and Wavelength Assignment in All-Optical Networks

Rajiv Ramaswami, Kumar N. Sivarajan

IEEE/ACM Transactions on Networking

View all publications