Matches in SemOpenAlex for { <https://semopenalex.org/work/W2043428092> ?p ?o ?g. }
Showing items 1 to 88 of
88
with 100 items per page.
- W2043428092 endingPage "136" @default.
- W2043428092 startingPage "127" @default.
- W2043428092 abstract "Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time O(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s e Vi and t e Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes O(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6).Our algorithm yields the useful corollary that in O(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an O(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an O(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut." @default.
- W2043428092 created "2016-06-24" @default.
- W2043428092 creator A5033068215 @default.
- W2043428092 creator A5062523877 @default.
- W2043428092 creator A5087182068 @default.
- W2043428092 date "2007-01-07" @default.
- W2043428092 modified "2023-09-23" @default.
- W2043428092 title "Efficient algorithms for computing all low s-t edge connectivities and related problems" @default.
- W2043428092 cites W1563553901 @default.
- W2043428092 cites W1980942794 @default.
- W2043428092 cites W1986207529 @default.
- W2043428092 cites W2012287357 @default.
- W2043428092 cites W2049291408 @default.
- W2043428092 cites W2068888615 @default.
- W2043428092 cites W2099463627 @default.
- W2043428092 cites W2115049345 @default.
- W2043428092 cites W2140498229 @default.
- W2043428092 doi "https://doi.org/10.5555/1283383.1283398" @default.
- W2043428092 hasPublicationYear "2007" @default.
- W2043428092 type Work @default.
- W2043428092 sameAs 2043428092 @default.
- W2043428092 citedByCount "12" @default.
- W2043428092 countsByYear W20434280922013 @default.
- W2043428092 countsByYear W20434280922014 @default.
- W2043428092 countsByYear W20434280922017 @default.
- W2043428092 countsByYear W20434280922019 @default.
- W2043428092 countsByYear W20434280922020 @default.
- W2043428092 countsByYear W20434280922021 @default.
- W2043428092 countsByYear W20434280922022 @default.
- W2043428092 crossrefType "proceedings-article" @default.
- W2043428092 hasAuthorship W2043428092A5033068215 @default.
- W2043428092 hasAuthorship W2043428092A5062523877 @default.
- W2043428092 hasAuthorship W2043428092A5087182068 @default.
- W2043428092 hasConcept C11413529 @default.
- W2043428092 hasConcept C114614502 @default.
- W2043428092 hasConcept C118615104 @default.
- W2043428092 hasConcept C132525143 @default.
- W2043428092 hasConcept C162307627 @default.
- W2043428092 hasConcept C3017489831 @default.
- W2043428092 hasConcept C3018234147 @default.
- W2043428092 hasConcept C311688 @default.
- W2043428092 hasConcept C33923547 @default.
- W2043428092 hasConcept C41008148 @default.
- W2043428092 hasConcept C42812 @default.
- W2043428092 hasConcept C76155785 @default.
- W2043428092 hasConcept C80899671 @default.
- W2043428092 hasConceptScore W2043428092C11413529 @default.
- W2043428092 hasConceptScore W2043428092C114614502 @default.
- W2043428092 hasConceptScore W2043428092C118615104 @default.
- W2043428092 hasConceptScore W2043428092C132525143 @default.
- W2043428092 hasConceptScore W2043428092C162307627 @default.
- W2043428092 hasConceptScore W2043428092C3017489831 @default.
- W2043428092 hasConceptScore W2043428092C3018234147 @default.
- W2043428092 hasConceptScore W2043428092C311688 @default.
- W2043428092 hasConceptScore W2043428092C33923547 @default.
- W2043428092 hasConceptScore W2043428092C41008148 @default.
- W2043428092 hasConceptScore W2043428092C42812 @default.
- W2043428092 hasConceptScore W2043428092C76155785 @default.
- W2043428092 hasConceptScore W2043428092C80899671 @default.
- W2043428092 hasLocation W20434280921 @default.
- W2043428092 hasOpenAccess W2043428092 @default.
- W2043428092 hasPrimaryLocation W20434280921 @default.
- W2043428092 hasRelatedWork W1447961680 @default.
- W2043428092 hasRelatedWork W1611628598 @default.
- W2043428092 hasRelatedWork W1964773853 @default.
- W2043428092 hasRelatedWork W1986207529 @default.
- W2043428092 hasRelatedWork W1996575062 @default.
- W2043428092 hasRelatedWork W1998002108 @default.
- W2043428092 hasRelatedWork W2000348096 @default.
- W2043428092 hasRelatedWork W2012287357 @default.
- W2043428092 hasRelatedWork W2021441806 @default.
- W2043428092 hasRelatedWork W2028643523 @default.
- W2043428092 hasRelatedWork W2032863725 @default.
- W2043428092 hasRelatedWork W2115049345 @default.
- W2043428092 hasRelatedWork W2123805664 @default.
- W2043428092 hasRelatedWork W2140498229 @default.
- W2043428092 hasRelatedWork W2146409551 @default.
- W2043428092 hasRelatedWork W2258857078 @default.
- W2043428092 hasRelatedWork W2883501625 @default.
- W2043428092 hasRelatedWork W2938795088 @default.
- W2043428092 hasRelatedWork W3000811701 @default.
- W2043428092 hasRelatedWork W3210180238 @default.
- W2043428092 isParatext "false" @default.
- W2043428092 isRetracted "false" @default.
- W2043428092 magId "2043428092" @default.
- W2043428092 workType "article" @default.