Title :
New mathematical model for finding minimum vertex cut set
Author :
Beseri Sevim, Tina ; Kutucu, Hakan ; Berberler, Murat Ersen
Author_Institution :
Izmir Inst. of Technol., Izmir, Turkey
Abstract :
In this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex separator problem consists in identifying a minimum number of vertex set whose removal disconnects G. We present a new mathematical model for solving this problem and also present computational results on graphs with various density.
Keywords :
directed graphs; set theory; mathematical model; minimum vertex cut set; undirected graph; vertex separator problem; vertex set; connectivity; maximum flow; minimum 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.6486469
