Some New Algorithms for Deterministic and Probabilistic Communication Networks.

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)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1974
Accession Number
AD0785119

Entities

People

  • B. J. Leon
  • P. M. Lin
  • R. Krzyzanowski
  • Tao Huang

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computer Programs
  • Computers
  • Networks
  • Reliability
  • Terminals

Fields of Study

  • Computer science

Readers

  • Neural Network Machine Learning.
  • Operations Research
  • Software Engineering