Title :
New algorithm for finding minimum vertex cut set
Author :
Ugurlu, Onur ; Berberler, Murat Ersen ; Kizilates, G. ; Kurt, Meltem
Author_Institution :
Ege Univ., Izmir, Turkey
Abstract :
The number of vertex-connectivity, is an element the least number of elements in a set of vertex, which makes a graph disconnected. Researches relate to the discovery of the number of vertex-connectivity. In this paper, an algorithm that provides to find elements of Vertex-Cut Set is proposed. Complexity analysis of the algorithm is performed, and the trials are shared about written program.
Keywords :
graph theory; set theory; graph; minimum vertex cut set; vertex-connectivity; Menger theorem; maximum flow; vertex connectivity; vertex-cut set;
Conference_Titel :
Problems of Cybernetics and Informatics (PCI), 2012 IV International Conference
Conference_Location :
Baku
Print_ISBN :
978-1-4673-4500-2
DOI :
10.1109/ICPCI.2012.6486470
