NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Cut it out!

Published

Author(s)

Isabel M. Beichl, Francis Sullivan

Abstract

This is a tutorial article on a probabilistic method for finding minimum cut sets of a connected graph.
Citation
Computing in Science & Engineering
Volume
11
Issue
3
Pub Type
Journals

Keywords

graph theory, cut sets, Monte Carlo methods
Information technology, Computational science, Data and informatics, Numerical methods and software and Statistical analysis

Citation

Beichl, I. and Sullivan, F. (2009), Cut it out!, Computing in Science & Engineering (Accessed October 11, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created May 1, 2009, Updated February 19, 2017
Was this page helpful?