Processor-Efficient Implementation of a Maximum Flow Algorithm,

Abstract

This paper describes two processor-efficient implementation of the Maximum Distance Discharge algorithm for the maximum flow problem. The maximum flow problem is a classical combinatorial optimization problem, which has been widely studied in the context of sequential computation. Recently, parallel algorithms for the problem have been studied as well. Although the problem is known to be P-complete significant speedups can be obtained by using a parallel algorithm for the problem, both in theory and in practice.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1990
Accession Number
ADA323469

Entities

People

  • Andrew V. Goldberg

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Heuristic Methods
  • Mathematical Analysis
  • Mathematics
  • Optimization

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.