<?xml version="1.0" encoding="UTF-8" ?>
<xml>
<records>
<record>
<title>How to find cut nodes and bridges in the network? A Matlab program
 and application in tumor pathways</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>Network Pharmacology</journal>
<issn>ISSN 2410-1000</issn>
<homepage>http://www.iaees.org/publications/journals/np/online-version.asp</homepage>
<year>2016</year>
<volume>1</volume>
<issue>3</issue>
<startpage>82</startpage>
<endpage>85</endpage>
<publisher>International Academy of Ecology and Environmental Sciences</publisher>
<location>Hong Kong</location>
<date>
<received>9 December 2015</received>
<accepted>7 January 2016</accepted>
<published>1 September 2016</published>
</date>
<keywords>
<keyword>network</keyword>
<keyword>cut nodes</keyword>
<keyword>bridges</keyword>
<keyword>Matlab</keyword>
</keywords>
<abstract>
A connected graph X is a block, if and only if for any three vertices u, v and w in X, there exists a path from u to w and the path does not contain v. In present article I present full Matlab codes of the algorithm for finding cut nodes and bridges in the network.
</abstract>
<doi>DOI 10.0000/issn-2410-1000-networkpahrmacology-2016-v1-0008</doi>
<url>http://www.iaees.org/publications/journals/np/articles/2016-1(3)/find-cut-nodes-and-bridges-in-the-network.pdf</url>
</record>
</records>
</xml>
