Title of article
An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
Author/Authors
Joseph Cheriyan، نويسنده , , Kurt Mehlhorn، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 1999
Pages
4
From page
239
To page
242
Keywords
Algorithms , computational complexity , Max-flow problem , Preflow-push method , Potential function arguments
Journal title
Information Processing Letters
Serial Year
1999
Journal title
Information Processing Letters
Record number
129046
Link To Document