<?xml version="1.0" encoding="UTF-8" ?>
<xml>
<records>
<record>
<title>Maximum matching of 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>Selforganizology</journal>
<issn>ISSN 2410-0080</issn>
<homepage>http://www.iaees.org/publications/journals/selforganizology/online-version.asp</homepage>
<year>2017</year>
<volume>4</volume>
<issue>4</issue>
<startpage>65</startpage>
<endpage>68</endpage>
<publisher>International Academy of Ecology and Environmental Sciences</publisher>
<location>Hong Kong</location>
<date>
<received>7 November 2016</received>
<accepted>12 December 2016</accepted>
<published>1 December 2017</published>
</date>
<keywords>
<keyword>network</keyword>
<keyword>maximum matching</keyword>
<keyword>Hungarian Algorithm</keyword>
<keyword>Matlab</keyword>
</keywords>
<abstract>
In this article, I present full Matlab codes of Hungarian Algorithm for maximum matching in the network.
</abstract>
<doi>DOI 10.0000/issn-2410-0080-selforganizology-2017-v4-0009</doi>
<url>http://www.iaees.org/publications/journals/selforganizology/articles/2017-4(4)/maximum-matching-of-the-network.pdf</url>
</record>
</records>
</xml>
