Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
On Implementing the Push—Relabel Method for the Maximum Flow Problem
Home
Publications
On Implementing the Push—Relabel Method for the Maximum Flow Problem
On Implementing the Push—Relabel Method for the Maximum Flow Problem
Authors:
BC
B. V. Cherkassky
B. V. Cherkassky
AG
A. V. Goldberg
A. V. Goldberg
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 December 1997
journal article
research article
Published by
Springer Nature
in
Algorithmica
Vol. 19
(4)
,
390-410
DOI:
10.1007/pl00009180
Abstract
No abstract available
Keywords
KEY WORDS. ALGORITHMS
NETWORK OPTIMIZATION
MAXIMUM FLOWS
EXPERIMENTAL EVALUATION.
Cited
Cited by 323 articles
Scroll to top