New algorithm for finding minimum vertex cut set
Conference paper > Full Text
Authors: Onur Ugurlu, Murat Ersen Berberler, Gözde Kızılates, Mehmet Kurt
2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI), , , International, Full Text, pp 1-4
DOI: 10.1109/icpci.2012.6486470
Summary
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.