Accession Number : AD0785119

Title :   Some New Algorithms for Deterministic and Probabilistic Communication Networks.

Descriptive Note : Phase rept.,

Corporate Author : PURDUE UNIV LAFAYETTE IND

Personal Author(s) : Lin,P. M. ; Leon,B. J. ; Huang,T. C. ; Krzyzanowski,R.

Report Date : JUN 1974

Pagination or Media Count : 92

Abstract : The objective of the effort reported herein is twofold: to develop more efficient algorithms for communication networks and to implement the algorithms. Two problems are included: the maximum flow problem and the terminal-pair reliability problem. For the maximum flow problem, a new labeling algorithm has been proposed. A complete documentation of the computer program is included. (Author)

Descriptors :   *Communications networks, *Network flows, Routing, Reliability, Mathematical models, Computer programs

Subject Categories : Operations Research
      Non-radio Communications

Distribution Statement : APPROVED FOR PUBLIC RELEASE