Maximum concurrent flow and minimum ratio cut /
C.K. Cheng and T.C. Hu

Description

Tools

Cite this Export citation file

Main Author: Cheng, C. K
Related Names: Hu, T. C. (Te Chiang), 1930-
University of California, San Diego. Dept. of Computer Science and Engineering
Language(s): English
Published: La Jolla, Calif. : Dept. of Computer Science and Engineering, University of California, San Diego, [1988]
Physical Description: 12, [1] leaves : ill. ; 28 cm
Locate a Print Version: Find in a library

Viewability

Item Link	Original Source
Limited (search only)	University of California

View HathiTrust MARC record

Similar Items

The optimal partitioning of networks

Author: Cheng, C. K
Published: 1989

Ancestor tree for multi-terminal cut functions

Author: Cheng, C. K
Published: 1989

The orientation of modules based on graph decomposition

Author: Cheng, C. K
Published: 1988

Anatomy of on-line bin packing

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1988

Generalizing the maximum folding problem

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1991

The checkmate condition and the super-simplex algorithm

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1988

Optimization of globally convex functions

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1989

Combinatorial algorithms

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1982

Integer programming and network flows

Author: Hu, T. C. (Te Chiang), 1930-
Published: 1969

Program testing versus proofs of correctness

Author: Howden, William E
Published: 1988