{"_id":"11683","publication_identifier":{"issn":["0196-6774"]},"language":[{"iso":"eng"}],"keyword":["Computational Theory and Mathematics","Computational Mathematics","Control and Optimization"],"article_type":"original","issue":"2","title":"Computing vertex connectivity: New bounds from old techniques","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","doi":"10.1006/jagm.1999.1055","publication":"Journal of Algorithms","extern":"1","date_created":"2022-07-28T08:56:10Z","type":"journal_article","citation":{"ista":"Henzinger MH, Rao S, Gabow HN. 2000. Computing vertex connectivity: New bounds from old techniques. Journal of Algorithms. 34(2), 222–250.","chicago":"Henzinger, Monika H, Satish Rao, and Harold N. Gabow. “Computing Vertex Connectivity: New Bounds from Old Techniques.” <i>Journal of Algorithms</i>. Elsevier, 2000. <a href=\"https://doi.org/10.1006/jagm.1999.1055\">https://doi.org/10.1006/jagm.1999.1055</a>.","apa":"Henzinger, M. H., Rao, S., &#38; Gabow, H. N. (2000). Computing vertex connectivity: New bounds from old techniques. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1006/jagm.1999.1055\">https://doi.org/10.1006/jagm.1999.1055</a>","short":"M.H. Henzinger, S. Rao, H.N. Gabow, Journal of Algorithms 34 (2000) 222–250.","ama":"Henzinger MH, Rao S, Gabow HN. Computing vertex connectivity: New bounds from old techniques. <i>Journal of Algorithms</i>. 2000;34(2):222-250. doi:<a href=\"https://doi.org/10.1006/jagm.1999.1055\">10.1006/jagm.1999.1055</a>","ieee":"M. H. Henzinger, S. Rao, and H. N. Gabow, “Computing vertex connectivity: New bounds from old techniques,” <i>Journal of Algorithms</i>, vol. 34, no. 2. Elsevier, pp. 222–250, 2000.","mla":"Henzinger, Monika H., et al. “Computing Vertex Connectivity: New Bounds from Old Techniques.” <i>Journal of Algorithms</i>, vol. 34, no. 2, Elsevier, 2000, pp. 222–50, doi:<a href=\"https://doi.org/10.1006/jagm.1999.1055\">10.1006/jagm.1999.1055</a>."},"year":"2000","author":[{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"first_name":"Satish","last_name":"Rao","full_name":"Rao, Satish"},{"last_name":"Gabow","full_name":"Gabow, Harold N.","first_name":"Harold N."}],"article_processing_charge":"No","status":"public","page":"222-250","abstract":[{"text":"The vertex connectivity κ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known deterministic algorithm for finding the vertex connectivity and a corresponding separator. The time for a digraph having n vertices and m edges is O(min{κ3 + n, κn}m); for an undirected graph the term m can be replaced by κn. A randomized algorithm finds κ with error probability 1/2 in time O(nm). If the vertices have nonnegative weights the weighted vertex connectivity is found in time O(κ1nmlog(n2/m)) where κ1 ≤ m/n is the unweighted vertex connectivity or in expected time O(nmlog(n2/m)) with error probability 1/2. The main algorithm combines two previous vertex connectivity algorithms and a generalization of the preflow-push algorithm of Hao and Orlin (1994, J. Algorithms17, 424–446) that computes edge connectivity.","lang":"eng"}],"date_published":"2000-02-01T00:00:00Z","publication_status":"published","month":"02","publisher":"Elsevier","volume":34,"oa_version":"None","day":"01","date_updated":"2022-09-12T09:06:48Z","scopus_import":"1","intvolume":"        34"}