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

Paper

Serving Deep Learning Models with Deduplication from Relational Databases

Lixi Zhou, Jiaqing Chen, et al.

VLDB

Paper

Routing and Wavelength Assignment in All-Optical Networks

Rajiv Ramaswami, Kumar N. Sivarajan

IEEE/ACM Transactions on Networking

Paper

DESIGN OF THE REXX LANGUAGE.

M.F. Cowlishaw

IBM Systems Journal

Conference paper

A component by component listening test analysis of the IBM trainable speech synthesis system

Robert E. Donovan

INTERSPEECH - Eurospeech 2001

View all publications