The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.148, Iss.1, 1995-08, pp. : 165-170

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Self-adapting maximum flow routing for autonomous wireless sensor networks

By Bogliolo Alessandro Delpriori Saverio Lattanzi Emanuele Seraghiti Andrea

Cluster Computing, Vol. 14, Iss. 1, 2011-03 ,pp. : 1-14

Springer Publishing Company

Access to resources Recommend Favorite

Minimize the Maximum Duty in Multi-interface Networks

By D’Angelo Gianlorenzo Stefano Gabriele Navarra Alfredo

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 274-295

Springer Publishing Company

Access to resources Recommend Favorite

The ''smallest'' ring of polynomial invariants of a permutation group which has no finite SAGBI bases w.r.t. any admissible order

By Gobel M.

Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. : 177-184

Elsevier

Access to resources Recommend Favorite

The maximum flow problem: a real-time approach

By Nagy N. Akl S.G.

Parallel Computing, Vol. 29, Iss. 6, 2003-06 ,pp. : 767-794

Elsevier

Access to resources Recommend Favorite

Maximum Flow in Directed Planar Graphs with Vertex Capacities

By Kaplan Haim Nussbaum Yahav

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 174-189

Springer Publishing Company

Access to resources Recommend Favorite