New Mathematical Model for Finding Minimum Vertex Cut Set
Loading...
Files
Date
Authors
Journal Title
Journal ISSN
Volume Title
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
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
Keywords
Graph theory, Connectivity, Maximum flow, Minimum vertex cut set, Separators, Graph theory, Connectivity, Maximum flow, Separators, Minimum vertex cut set
Fields of Science
0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Citation
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
WoS Q
Scopus Q
OpenCitations Citation Count
4
Volume
Issue
Start Page
1
End Page
2
PlumX Metrics
Citations
CrossRef : 4
Scopus : 7
Captures
Mendeley Readers : 4
SCOPUS™ Citations
7
checked on May 08, 2026
Page Views
669
checked on May 08, 2026
Downloads
492
checked on May 08, 2026
Google Scholar™
