New Mathematical Model for Finding Minimum Vertex Cut Set
| dc.contributor.author | Beşeri Sevim, Tina | |
| dc.contributor.author | Kutucu, Hakan | |
| dc.contributor.author | Berberler, Murat Erşen | |
| dc.coverage.doi | 10.1109/ICPCI.2012.6486469 | |
| dc.date.accessioned | 2017-03-30T06:53:04Z | |
| dc.date.available | 2017-03-30T06:53:04Z | |
| dc.date.issued | 2012 | |
| dc.description | 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012; Baku; Azerbaijan; 12 September 2012 through 14 September 2012 | en_US |
| dc.description.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. | en_US |
| dc.identifier.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 | en_US |
| dc.identifier.doi | 10.1109/ICPCI.2012.6486469 | en_US |
| dc.identifier.doi | 10.1109/ICPCI.2012.6486469 | |
| dc.identifier.isbn | 9781467345026 | |
| dc.identifier.scopus | 2-s2.0-84875968170 | |
| dc.identifier.uri | http://doi.org/10.1109/ICPCI.2012.6486469 | |
| dc.identifier.uri | https://hdl.handle.net/11147/5176 | |
| dc.language.iso | en | en_US |
| dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
| dc.relation.ispartof | 4th International Conference "Problems of Cybernetics and Informatics", PCI 2012 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Graph theory | en_US |
| dc.subject | Connectivity | en_US |
| dc.subject | Maximum flow | en_US |
| dc.subject | Minimum vertex cut set | en_US |
| dc.subject | Separators | en_US |
| dc.title | New Mathematical Model for Finding Minimum Vertex Cut Set | en_US |
| dc.type | Conference Object | en_US |
| dspace.entity.type | Publication | |
| gdc.author.institutional | Beşeri Sevim, Tina | |
| gdc.author.institutional | Kutucu, Hakan | |
| gdc.author.yokid | 130915 | |
| gdc.bip.impulseclass | C5 | |
| gdc.bip.influenceclass | C5 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::conference output | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | İzmir Institute of Technology. Mathematics | en_US |
| gdc.description.endpage | 2 | |
| gdc.description.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | N/A | |
| gdc.description.startpage | 1 | |
| gdc.description.wosquality | N/A | |
| gdc.identifier.openalex | W2542919813 | |
| gdc.identifier.wos | WOS:000320337500209 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 1.0 | |
| gdc.oaire.influence | 3.0822325E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Graph theory | |
| gdc.oaire.keywords | Connectivity | |
| gdc.oaire.keywords | Maximum flow | |
| gdc.oaire.keywords | Separators | |
| gdc.oaire.keywords | Minimum vertex cut set | |
| gdc.oaire.popularity | 1.9641404E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0211 other engineering and technologies | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 0.75806771 | |
| gdc.openalex.normalizedpercentile | 0.76 | |
| gdc.opencitations.count | 4 | |
| gdc.plumx.crossrefcites | 4 | |
| gdc.plumx.mendeley | 4 | |
| gdc.plumx.scopuscites | 7 | |
| gdc.scopus.citedcount | 7 | |
| gdc.wos.citedcount | 0 | |
| relation.isAuthorOfPublication.latestForDiscovery | ed65b93e-dc95-40b7-b53e-9cf5ced48d04 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 9af2b05f-28ac-4012-8abe-a4dfe192da5e |