FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2982304810> ?p ?o ?g. }

• W2982304810 abstract "Consider the following cut-detection problem in a directed graph: We are given a seed vertex $x$ and need to remove at most $k$ edges so that at most $nu$ edges can be reached from $x$ (a cut) or output $bot$ to indicate that no such cut exists. If we are given query access to the input graph, then this problem can in principle be solved without reading the whole graph and with query complexity depending on $k$ and $nu$. In this paper we consider a slack variant of this problem where, when such a cut exists, we can output a cut with up to $O(knu)$ edges reachable from $x$. We present a simple randomized algorithm spending $O(k^2nu)$ time and $O(knu)$ queries for the above variant, improving in particular a previous time bound of $O(k^{O(k)}nu)$ by Chechik et al. [SODA '17]. We also extend our algorithm to handle an approximate variant. We demonstrate that these local algorithms are versatile primitives for designing substantially improved algorithms for classic graph problems by providing the following three applications. (Throughout, $tilde O(T)$ hides $operatorname{polylog}(T)$.) (1) A randomized algorithm for the classic $k$-vertex connectivity problem that takes near-linear time when $k=O(operatorname{polylog}(n))$, namely $tilde O(m+nk^3)$ time in undirected graphs. For directed graphs our $tilde O(mk^2)$-time algorithm is near-linear when $k=O(operatorname{polylog}(n))$. Our techniques also yield an improved approximation scheme. (2) Property testing algorithms for $k$-edge and -vertex connectivity with query complexities that are near-linear in $k$, exponentially improving the state-of-the-art. This resolves two open problems, one by Goldreich and Ron [STOC '97] and one by Orenstein and Ron [Theor. Comput Sci. '11]. (3) A faster algorithm for computing the maximal $k$-edge connected subgraphs, improving prior work of Chechik et al. [SODA '17]." @default.
• W2982304810 created "2019-11-08" @default.
• W2982304810 creator A5003431697 @default.
• W2982304810 creator A5010547647 @default.
• W2982304810 creator A5058859965 @default.
• W2982304810 creator A5068060092 @default.
• W2982304810 creator A5074369690 @default.
• W2982304810 date "2019-10-31" @default.
• W2982304810 modified "2023-10-07" @default.
• W2982304810 title "Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms" @default.
• W2982304810 cites W1510700297 @default.
• W2982304810 cites W1543491698 @default.
• W2982304810 cites W1964510837 @default.
• W2982304810 cites W1970630090 @default.
• W2982304810 cites W1974912205 @default.
• W2982304810 cites W1980816908 @default.
• W2982304810 cites W1994556169 @default.
• W2982304810 cites W2001004241 @default.
• W2982304810 cites W2006378656 @default.
• W2982304810 cites W2008292658 @default.
• W2982304810 cites W2012287357 @default.
• W2982304810 cites W2012310530 @default.
• W2982304810 cites W2016124646 @default.
• W2982304810 cites W2022140055 @default.
• W2982304810 cites W2028503265 @default.
• W2982304810 cites W2035315311 @default.
• W2982304810 cites W2035435951 @default.
• W2982304810 cites W2038708787 @default.
• W2982304810 cites W2045430818 @default.
• W2982304810 cites W2055314845 @default.
• W2982304810 cites W2083157001 @default.
• W2982304810 cites W2083280764 @default.
• W2982304810 cites W2102699055 @default.
• W2982304810 cites W2111332454 @default.
• W2982304810 cites W2115458940 @default.
• W2982304810 cites W2118382442 @default.
• W2982304810 cites W2121765622 @default.
• W2982304810 cites W2132877659 @default.
• W2982304810 cites W2148988287 @default.
• W2982304810 cites W2568781740 @default.
• W2982304810 cites W2569104968 @default.
• W2982304810 cites W2728002894 @default.
• W2982304810 cites W2751862591 @default.
• W2982304810 cites W2945031003 @default.
• W2982304810 cites W2950039944 @default.
• W2982304810 cites W2963947323 @default.
• W2982304810 cites W2963972775 @default.
• W2982304810 cites W2964010100 @default.
• W2982304810 cites W2964121826 @default.
• W2982304810 cites W3104306072 @default.
• W2982304810 cites W1573638212 @default.
• W2982304810 hasPublicationYear "2019" @default.
• W2982304810 type Work @default.
• W2982304810 sameAs 2982304810 @default.
• W2982304810 citedByCount "0" @default.
• W2982304810 crossrefType "posted-content" @default.
• W2982304810 hasAuthorship W2982304810A5003431697 @default.
• W2982304810 hasAuthorship W2982304810A5010547647 @default.
• W2982304810 hasAuthorship W2982304810A5058859965 @default.
• W2982304810 hasAuthorship W2982304810A5068060092 @default.
• W2982304810 hasAuthorship W2982304810A5074369690 @default.
• W2982304810 hasConcept C11413529 @default.
• W2982304810 hasConcept C114614502 @default.
• W2982304810 hasConcept C118615104 @default.
• W2982304810 hasConcept C123842658 @default.
• W2982304810 hasConcept C128669082 @default.
• W2982304810 hasConcept C132525143 @default.
• W2982304810 hasConcept C134306372 @default.
• W2982304810 hasConcept C146380142 @default.
• W2982304810 hasConcept C148764684 @default.
• W2982304810 hasConcept C3017489831 @default.
• W2982304810 hasConcept C3018234147 @default.
• W2982304810 hasConcept C311688 @default.
• W2982304810 hasConcept C33923547 @default.
• W2982304810 hasConcept C36686422 @default.
• W2982304810 hasConcept C63553672 @default.
• W2982304810 hasConcept C77553402 @default.
• W2982304810 hasConcept C80899671 @default.
• W2982304810 hasConceptScore W2982304810C11413529 @default.
• W2982304810 hasConceptScore W2982304810C114614502 @default.
• W2982304810 hasConceptScore W2982304810C118615104 @default.
• W2982304810 hasConceptScore W2982304810C123842658 @default.
• W2982304810 hasConceptScore W2982304810C128669082 @default.
• W2982304810 hasConceptScore W2982304810C132525143 @default.
• W2982304810 hasConceptScore W2982304810C134306372 @default.
• W2982304810 hasConceptScore W2982304810C146380142 @default.
• W2982304810 hasConceptScore W2982304810C148764684 @default.
• W2982304810 hasConceptScore W2982304810C3017489831 @default.
• W2982304810 hasConceptScore W2982304810C3018234147 @default.
• W2982304810 hasConceptScore W2982304810C311688 @default.
• W2982304810 hasConceptScore W2982304810C33923547 @default.
• W2982304810 hasConceptScore W2982304810C36686422 @default.
• W2982304810 hasConceptScore W2982304810C63553672 @default.
• W2982304810 hasConceptScore W2982304810C77553402 @default.
• W2982304810 hasConceptScore W2982304810C80899671 @default.
• W2982304810 hasLocation W29823048101 @default.
• W2982304810 hasOpenAccess W2982304810 @default.
• W2982304810 hasPrimaryLocation W29823048101 @default.
• W2982304810 hasRelatedWork W1537954077 @default.
• W2982304810 hasRelatedWork W2044334960 @default.

• next