New Mathematical Model for Finding Minimum Vertex Cut Set

Creative Commons License

Sevim T. B., Kutucu H., BERBERLER M. E.

4th International Conference on Problems of Cybernetics and Informatics (PCI), Baku, Azerbaycan, 12 - 14 Eylül 2012 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/icpci.2012.6486469
  • Basıldığı Şehir: Baku
  • Basıldığı Ülke: Azerbaycan
  • Anahtar Kelimeler: connectivity, minimum vertex cut set, maximum flow, ALGORITHM, CONNECTIVITY, FLOW
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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.