<?xml version="1.0" encoding="UTF-8"?>
<records>
<record>
<language>eng</language>
<publisher>International Academy of Ecology and Environmental Sciences</publisher>
<journalTitle>Computational Ecology and Software</journalTitle>
<issn>2220-721X</issn>
<publicationDate>2018-6-1</publicationDate>
<volume>8</volume>
<issue>2</issue>
<startPage>57</startPage>
<endPage>61</endPage>
<doi> </doi>
<publisherRecordId>2</publisherRecordId>
<documentType>article</documentType>
<title language="eng">Finding maximum flow in the network: A Matlab program and 
application</title>
<authors>
<author>
<name>WenJun Zhang</name>
<email></email>
<affiliationId>1</affiliationId>
<affiliationId>2</affiliationId>
</author>
</authors>
<affiliationsList>
<affiliationName affiliationId="1">
School of Life Sciences, Sun Yat-sen University, Guangzhou 510275, China; International Academy of Ecology and
 Environmental Sciences, Hong Kong
</affiliationName>
</affiliationsList>
<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>
<fullTextUrl format="pdf">
http://www.iaees.org/publications/journals/ces/articles/2018-8(2)/finding-maximum-flow-in-the-network.pdf
</fullTextUrl>
<keywords>
<keyword>network</keyword>
<keyword>Ford-Fulkerson algorithm</keyword>
<keyword>maximum flow</keyword>
<keyword>Matlab</keyword>
</keywords>
</record>
</records>
