<?xml version="1.0" encoding="UTF-8" ?>
<xml>
<records>
<record>
<title>Finding maximum flow in the network: A Matlab program and 
application</title>
<authors>
<author>WenJun Zhang</author>
</authors>
<affiliations>
<affiliation>
School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and
 Environmental Sciences, Hong Kong
</affiliation>
</affiliations>
<journal>Computational Ecology and Software</journal>
<issn>ISSN 2220-721X</issn>
<homepage>http://www.iaees.org/publications/journals/ces/online-version.asp</homepage>
<year>2018</year>
<volume>8</volume>
<issue>2</issue>
<startpage>57</startpage>
<endpage>61</endpage>
<publisher>International Academy of Ecology and Environmental Sciences</publisher>
<location>Hong Kong</location>
<date>
<received>9 August 2016</received>
<accepted>6 October 2017</accepted>
<published>1 June 2018</published>
</date>
<keywords>
<keyword>network</keyword>
<keyword>Ford-Fulkerson algorithm</keyword>
<keyword>maximum flow</keyword>
<keyword>Matlab</keyword>
</keywords>
<abstract>
Maximum flow problems are expected occurring in some biological networks. As early as in 1950s, Ford and Fulkcerson proposed an algorithm to find maximum flow in a network. In this study I presented the full codes of Ford-Fulkcerson algorithm and given an application example.
</abstract>
<url>http://www.iaees.org/publications/journals/ces/articles/2018-8(2)/finding-maximum-flow-in-the-network.pdf</url>
</record>
</records>
</xml>
