An efficient network flow code for finding all minimum cost s-t cutsets

Computers and Operations Research

Volumn 29, Issue 3, 2002, Pages 205-219

  Curet, Norman D ^a,b   DeVinney, Jason ^a   Gaston, Matthew E ^a  

^a ARMED FORCES INSTITUTE OF PATHOLOGY   (United States)

^b NONE   (United States)

Author keywords

Graph theory; Maximum flow; Military applications

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; ELECTRIC NETWORK TOPOLOGY; GRAPHIC METHODS; MILITARY APPLICATIONS; PROBLEM SOLVING;

CUTSET ALGORITHMS;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0036489509     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00058-7     Document Type: Article

References (15)

1. A paradigm for listing (s,t)-cuts in graphs
2. Experimental study of minimum cut algorithms
3. Vertex cutsets of undirected graphs
4. Generation of vertex and edge cutsets
5. A new approach to the maximum-flow problem
6. On implementing push-relabel method for the maximum flow problem
7. On the structure of all minimum cuts in a network and applications
8. Dynamic programming solution of sequencing problems with precedence constraints