New algorithm for finding minimum vertex cut set
2012 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012, Baku, Azerbaycan, 12 - 14 Eylül 2012, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası:
- Doi Numarası: 10.1109/icpci.2012.6486470
- Basıldığı Şehir: Baku
- Basıldığı Ülke: Azerbaycan
- Anahtar Kelimeler: maximum flow, Menger theorem, vertex connectivity, vertex-cut set
- Dokuz Eylül Üniversitesi Adresli: Evet
Özet
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. © 2012 IEEE.