Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
13
views
14
references
Top references
cited by
7
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,647
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Integer Programming and Combinatorial Optimization
On implementing push-relabel method for the maximum flow problem
other
Author(s):
Boris V. Cherkassky
,
Andrew V. Goldberg
Publication date
(Online):
June 1 2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
General Collective Intelligence Platforms and Hive Minds
Most cited references
14
Record
: found
Abstract
: not found
Article
: not found
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Jack Edmonds
,
Richard M Karp
(1972)
0
comments
Cited
242
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A new approach to the maximum-flow problem
Andrew Goldberg
,
Robert Tarjan
(1988)
0
comments
Cited
200
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
A new approach to the maximum flow problem
R. E. Tarjan
,
A. V. Goldberg
(1986)
0
comments
Cited
26
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1995
Publication date (Online):
June 1 2005
Pages
: 157-171
DOI:
10.1007/3-540-59408-6_49
SO-VID:
66fc3f0b-8e97-4250-b08a-6fb739d056ca
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Improved approximation algorithms for MAX k-CUT and MAX BISECTION
pp. 157
On implementing push-relabel method for the maximum flow problem
pp. 267
GRIN: An implementation of Gröbner bases for integer programming
Similar content
2,647
Net Widening and Relabeling
Authors:
Katherine Van Dusen
Interaction relabeling and extreme characters: methods for exploring aesthetic. Proceedings of the 2000 Conference on Designing Interactive Systems (DIS '02):
Authors:
J. Djajadiningrat
,
William Gaver
,
J. Frens
Quantum measurements on finite dimensional systems: relabeling and mixing
Authors:
Teiko Heinosaari
,
Erkka Haapasalo
,
Juha-Pekka Pellonpaa
See all similar
Cited by
7
Occlusions, discontinuities, and epipolar lines in stereo
Authors:
Hiroshi Ishikawa
,
Davi Geiger
Plant location with minimum inventory
Authors:
Francisco Barahona
,
David Jensen
Priority Queues Are Not Good Concurrent Priority Schedulers
Authors:
Andrew Lenharth
,
Donald Nguyen
,
Keshav Pingali
See all cited by