Matches in SemOpenAlex for { <https://semopenalex.org/work/W2962916904> ?p ?o ?g. }
- W2962916904 endingPage "1363" @default.
- W2962916904 startingPage "1335" @default.
- W2962916904 abstract "Depth first search (DFS) tree is a fundamental data structure for solving various problems in graphs. It is well known that it takes $O(m+n)$ time to build a DFS tree for a given undirected graph $G=(V,E)$ on $n$ vertices and $m$ edges. We address the problem of maintaining a DFS tree when the graph is undergoing updates (insertion and deletion of vertices or edges). We present the following results for this problem: (1) Fault tolerant DFS tree: There exists a data structure of size $tilde{O}(m)$ (where $tilde{O}$ hides the polylogarithmic factors) which can be preprocessed in $tilde{O}(m)$ time such that given any set ${cal F}$ of failed vertices or edges, a DFS tree of the graph $Gsetminus {cal F}$ can be reported in $tilde{O}(n|{cal F}|)$ time. (2) Fully dynamic DFS tree: There exists a fully dynamic algorithm for maintaining a DFS tree that takes $tilde{O}(m)$ time for preprocessing and worst case $tilde{O}(sqrt{mn})$ time per update for any arbitrary online sequence of updates. (3) Incremental DFS tree: There exists an incremental algorithm for maintaining a DFS tree that takes $tilde{O}(m)$ time for preprocessing and worst case $tilde{O}(n)$ time per update for any arbitrary online sequence of edge insertion. These are the first $o(m)$ worst case time results for maintaining a DFS tree of a dense graph in a dynamic environment. Moreover, our fully dynamic algorithm provides, in a seamless manner, the first deterministic algorithm for dense graphs with $O(1)$ query time and $o(m)$ worst case update time for connectivity, biconnectivity, and 2-edge connectivity in the dynamic subgraph model." @default.
- W2962916904 created "2019-07-30" @default.
- W2962916904 creator A5014870050 @default.
- W2962916904 creator A5024739923 @default.
- W2962916904 creator A5059835930 @default.
- W2962916904 creator A5060322225 @default.
- W2962916904 date "2019-01-01" @default.
- W2962916904 modified "2023-10-02" @default.
- W2962916904 title "Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier" @default.
- W2962916904 cites W1982440947 @default.
- W2962916904 cites W1982876676 @default.
- W2962916904 cites W1983546080 @default.
- W2962916904 cites W1985572324 @default.
- W2962916904 cites W1987374783 @default.
- W2962916904 cites W1989169588 @default.
- W2962916904 cites W1992869351 @default.
- W2962916904 cites W1998776409 @default.
- W2962916904 cites W2000198477 @default.
- W2962916904 cites W2009695707 @default.
- W2962916904 cites W2018804864 @default.
- W2962916904 cites W2020283440 @default.
- W2962916904 cites W2022973561 @default.
- W2962916904 cites W2023970268 @default.
- W2962916904 cites W2029814178 @default.
- W2962916904 cites W2038084411 @default.
- W2962916904 cites W2040746822 @default.
- W2962916904 cites W2045430818 @default.
- W2962916904 cites W2049105156 @default.
- W2962916904 cites W2049327803 @default.
- W2962916904 cites W2063860324 @default.
- W2962916904 cites W2078423836 @default.
- W2962916904 cites W2083394054 @default.
- W2962916904 cites W2083795876 @default.
- W2962916904 cites W2085467310 @default.
- W2962916904 cites W2097490969 @default.
- W2962916904 cites W2110089205 @default.
- W2962916904 cites W2118382442 @default.
- W2962916904 cites W2118914279 @default.
- W2962916904 cites W2121473031 @default.
- W2962916904 cites W2142255724 @default.
- W2962916904 cites W2157529519 @default.
- W2962916904 cites W2157901347 @default.
- W2962916904 cites W2611854190 @default.
- W2962916904 cites W2766824301 @default.
- W2962916904 cites W2800650906 @default.
- W2962916904 doi "https://doi.org/10.1137/17m114306x" @default.
- W2962916904 hasPublicationYear "2019" @default.
- W2962916904 type Work @default.
- W2962916904 sameAs 2962916904 @default.
- W2962916904 citedByCount "11" @default.
- W2962916904 countsByYear W29629169042019 @default.
- W2962916904 countsByYear W29629169042020 @default.
- W2962916904 countsByYear W29629169042021 @default.
- W2962916904 countsByYear W29629169042022 @default.
- W2962916904 countsByYear W29629169042023 @default.
- W2962916904 crossrefType "journal-article" @default.
- W2962916904 hasAuthorship W2962916904A5014870050 @default.
- W2962916904 hasAuthorship W2962916904A5024739923 @default.
- W2962916904 hasAuthorship W2962916904A5059835930 @default.
- W2962916904 hasAuthorship W2962916904A5060322225 @default.
- W2962916904 hasConcept C113174947 @default.
- W2962916904 hasConcept C11413529 @default.
- W2962916904 hasConcept C114614502 @default.
- W2962916904 hasConcept C118615104 @default.
- W2962916904 hasConcept C132525143 @default.
- W2962916904 hasConcept C138843760 @default.
- W2962916904 hasConcept C152043487 @default.
- W2962916904 hasConcept C3018234147 @default.
- W2962916904 hasConcept C311688 @default.
- W2962916904 hasConcept C33923547 @default.
- W2962916904 hasConcept C38652104 @default.
- W2962916904 hasConcept C41008148 @default.
- W2962916904 hasConceptScore W2962916904C113174947 @default.
- W2962916904 hasConceptScore W2962916904C11413529 @default.
- W2962916904 hasConceptScore W2962916904C114614502 @default.
- W2962916904 hasConceptScore W2962916904C118615104 @default.
- W2962916904 hasConceptScore W2962916904C132525143 @default.
- W2962916904 hasConceptScore W2962916904C138843760 @default.
- W2962916904 hasConceptScore W2962916904C152043487 @default.
- W2962916904 hasConceptScore W2962916904C3018234147 @default.
- W2962916904 hasConceptScore W2962916904C311688 @default.
- W2962916904 hasConceptScore W2962916904C33923547 @default.
- W2962916904 hasConceptScore W2962916904C38652104 @default.
- W2962916904 hasConceptScore W2962916904C41008148 @default.
- W2962916904 hasFunder F4320309327 @default.
- W2962916904 hasFunder F4320320767 @default.
- W2962916904 hasIssue "4" @default.
- W2962916904 hasLocation W29629169041 @default.
- W2962916904 hasOpenAccess W2962916904 @default.
- W2962916904 hasPrimaryLocation W29629169041 @default.
- W2962916904 hasRelatedWork W2023468831 @default.
- W2962916904 hasRelatedWork W2365973956 @default.
- W2962916904 hasRelatedWork W2605620386 @default.
- W2962916904 hasRelatedWork W2794388408 @default.
- W2962916904 hasRelatedWork W2914915498 @default.
- W2962916904 hasRelatedWork W2952002462 @default.
- W2962916904 hasRelatedWork W2970290256 @default.
- W2962916904 hasRelatedWork W4298062099 @default.