Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/5176| Title: | New mathematical model for finding minimum vertex cut set | Authors: | Beşeri Sevim, Tina Kutucu, Hakan Berberler, Murat Erşen |
Keywords: | Graph theory Connectivity Maximum flow Minimum vertex cut set Separators |
Publisher: | Institute of Electrical and Electronics Engineers Inc. | Source: | Beşeri Sevim, T., Kutucu, H., and Berberler, M. E. (2012, September 12-14). New mathematical model for finding minimum vertex cut set. Paper presented at the 4th International Conference "Problems of Cybernetics and Informatics". doi:10.1109/ICPCI.2012.6486469 | 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. © 2012 IEEE. | Description: | 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012; Baku; Azerbaijan; 12 September 2012 through 14 September 2012 | URI: | http://doi.org/10.1109/ICPCI.2012.6486469 http://hdl.handle.net/11147/5176 |
ISBN: | 9781467345026 |
| Appears in Collections: | Mathematics / Matematik Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
7
checked on Nov 15, 2024
Page view(s)
130
checked on Nov 18, 2024
Download(s)
362
checked on Nov 18, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.