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, Azerbaijan, 12 - 14 September 2012, (Full Text) identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/icpci.2012.6486469
  • City: Baku
  • Country: Azerbaijan
  • Keywords: connectivity, minimum vertex cut set, maximum flow, ALGORITHM, CONNECTIVITY, FLOW
  • Open Archive Collection: AVESIS Open Access Collection
  • Dokuz Eylül University Affiliated: Yes

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.