|
|||||
|
|
On the theoretical efficiency of various network flow algorithms |
|
| Authors: | Zvi Galil |
| Affiliation: | Department of Mathematical Sciences, Computer Science Division, Tel-Aviv University, Israel |
| Abstract: | The time bounds of various algorithms for finding the maximal flow in networks are shown to be tight by constructing one parametrized family of network flow problems and showing that the algorithms achieve the corresponding bounds on inputs from this family. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |