Some New Algorithms for Deterministic and Probabilistic Communication Networks.

reportActive / Technical Report | Accession Number: AD0785119 | Need Help?

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

Author(s):
Lin, P. M. ; Leon, B. J. ; Huang, T. C. ; Krzyzanowski, R.
Author Organization(s):
PURDUE UNIV LAFAYETTE IND
Descriptive Note:
Phase rept.,
Pagination:
0092

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
RADC-TR-74-150
Contract/Grant Number(s):
F30602-72-C-0438
Task Number(s):
956700
Project Number(s):
AF-9567
Monitor Series:
TR-74-150
 Subject Terms
Joint Capability Areas:
JCA_6.1_Information Transport; JCA_6_Net Centric
Communities of Interest:
No COI(s) Identified
Descriptor(s):
*Communications networks, *Network flows, Routing, Reliability, Mathematical models, Computer programs
Field(s)/Group(s):
Operations Research, Non-Radio Communications
Keyword(s):
*Graph theory
Report Date:
1974 Jun 01