SIGN IN
SIGN UP
A new approach to the maximum flow problem
Full Text:
PDF
Buy this Article
Authors:
A V Goldberg
Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
R E Tarjan
Computer Science Department, Princeton University, Princeton, NJ and AT&T Bell Laboratories, Murray Hill, NJ
Published in:
· Proceeding
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Pages 136-146
ACM
New York, NY
, USA
©1986
table of contents
ISBN:0-89791-193-8
doi>
10.1145/12130.12144
1986 Article
Bibliometrics
· Downloads (6 Weeks): 33
· Downloads (12 Months): 190
· Downloads (cumulative): 2,210
· Citation Count: 63
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
parallel algorithms
parallelism and concurrency
path and circuit problems
theory
trees
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder