Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine.

Abstract

This paper describes an implementation of the Push-Relabel method for the Maximum Flow problem on a Connection Machine and gives computation times of the implementation on several classes of problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1992
Accession Number
ADA323468

Entities

People

  • Andrew N. Goldberg
  • Farid Alizadeh

Organizations

  • Stanford University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Access Time
  • Algorithms
  • Commerce
  • Computer Programming
  • Computer Science
  • Computers
  • Computing System Architectures
  • Electronic Mail
  • Graphs
  • High Performance Computing
  • Host Computers
  • Instructions
  • Pipes
  • Programming Languages
  • Residuals
  • Segmented
  • Sequences

Fields of Study

  • Computer science

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Information Retrieval
  • Neural Network Machine Learning.