期刊名称：Studia Universitatis Babes-Bolyai : Series Informatica
印刷版ISSN：1224-869X
出版年度：2008
卷号：LIII
期号：01
页码：73-73
出版社：Babes-Bolyai University, Cluj-Napoca
摘要：We present augmenting path algorithms for minimum ows
with dynamic tree implementations. The time bounds for augmenting
path for minimum ows automatically improve when the algorithms are
implemented with dynamic tree.
