FRINK Linked Data Fragments server

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

• W2983843017 endingPage "33" @default.
• W2983843017 startingPage "1" @default.
• W2983843017 abstract "Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical algorithm [54] for building a DFS tree requires O ( m + n ) time for a given undirected graph G having n vertices and m edges. Recently, Baswana et al. [5] presented a simple algorithm for updating the DFS tree of an undirected graph after an edge/vertex update in Õ( n ) 1 time. However, their algorithm is strictly sequential. We present an algorithm achieving similar bounds that can be easily adopted to the parallel environment. In the parallel environment, a DFS tree can be computed from scratch in expected Õ(1) time [2] on an EREW PRAM, whereas the best deterministic algorithm takes Õ(√ n ) time [2, 27] on a CRCW PRAM. Our algorithm can be used to develop optimal time (to poly log n factors) deterministic parallel algorithms for maintaining fully dynamic DFS and fault tolerant DFS of an undirected graph. (1) Parallel Fully Dynamic DFS : Given an arbitrary online sequence of vertex or edge updates, we can maintain a DFS tree of an undirected graph in Õ(1) time per update using m processors on an EREW PRAM. (2) Parallel Fault tolerant DFS : An undirected graph can be preprocessed to build a data structure of size O ( m ), such that for any set of k updates (where k is constant) in the graph, a DFS tree of the updated graph can be computed in Õ(1) time using n processors on an EREW PRAM. For constant k , this is also work optimal (to poly log n factors). Moreover, our fully dynamic DFS algorithm provides, in a seamless manner, nearly optimal (to poly log n factors) algorithms for maintaining a DFS tree in the semi-streaming environment and a restricted distributed model. These are the first parallel, semi-streaming, and distributed algorithms for maintaining a DFS tree in the dynamic setting." @default.
• W2983843017 created "2019-11-22" @default.
• W2983843017 creator A5014870050 @default.
• W2983843017 date "2019-09-30" @default.
• W2983843017 modified "2023-09-26" @default.
• W2983843017 title "Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs" @default.
• W2983843017 cites W1523934134 @default.
• W2983843017 cites W1590701623 @default.
• W2983843017 cites W1721652159 @default.
• W2983843017 cites W1977458171 @default.
• W2983843017 cites W1978583881 @default.
• W2983843017 cites W1978615272 @default.
• W2983843017 cites W1982792741 @default.
• W2983843017 cites W1983546080 @default.
• W2983843017 cites W1986973819 @default.
• W2983843017 cites W1991752483 @default.
• W2983843017 cites W1995587182 @default.
• W2983843017 cites W1998776409 @default.
• W2983843017 cites W2003024612 @default.
• W2983843017 cites W2008292658 @default.
• W2983843017 cites W2012456804 @default.
• W2983843017 cites W2016289973 @default.
• W2983843017 cites W2020283440 @default.
• W2983843017 cites W2023670982 @default.
• W2983843017 cites W2030218931 @default.
• W2983843017 cites W2030543286 @default.
• W2983843017 cites W2032370604 @default.
• W2983843017 cites W2032793800 @default.
• W2983843017 cites W2046946959 @default.
• W2983843017 cites W2049105156 @default.
• W2983843017 cites W2049327803 @default.
• W2983843017 cites W2049713017 @default.
• W2983843017 cites W2055655252 @default.
• W2983843017 cites W2056942590 @default.
• W2983843017 cites W2058330097 @default.
• W2983843017 cites W2064306958 @default.
• W2983843017 cites W2073273423 @default.
• W2983843017 cites W2077059864 @default.
• W2983843017 cites W2080566336 @default.
• W2983843017 cites W2085467310 @default.
• W2983843017 cites W2113734481 @default.
• W2983843017 cites W2118382442 @default.
• W2983843017 cites W2395939851 @default.
• W2983843017 cites W2467525240 @default.
• W2983843017 cites W2591972614 @default.
• W2983843017 cites W2611566349 @default.
• W2983843017 cites W2779584863 @default.
• W2983843017 cites W2962916904 @default.
• W2983843017 cites W3101261712 @default.
• W2983843017 cites W31329063 @default.
• W2983843017 cites W4205300528 @default.
• W2983843017 cites W4230889046 @default.
• W2983843017 cites W4312512934 @default.
• W2983843017 cites W45869233 @default.
• W2983843017 cites W2170762273 @default.
• W2983843017 doi "https://doi.org/10.1145/3364212" @default.
• W2983843017 hasPublicationYear "2019" @default.
• W2983843017 type Work @default.
• W2983843017 sameAs 2983843017 @default.
• W2983843017 citedByCount "2" @default.
• W2983843017 countsByYear W29838430172022 @default.
• W2983843017 countsByYear W29838430172023 @default.
• W2983843017 crossrefType "journal-article" @default.
• W2983843017 hasAuthorship W2983843017A5014870050 @default.
• W2983843017 hasBestOaLocation W29838430172 @default.
• W2983843017 hasConcept C11413529 @default.
• W2983843017 hasConcept C114614502 @default.
• W2983843017 hasConcept C118615104 @default.
• W2983843017 hasConcept C120373497 @default.
• W2983843017 hasConcept C125583679 @default.
• W2983843017 hasConcept C132525143 @default.
• W2983843017 hasConcept C138843760 @default.
• W2983843017 hasConcept C152043487 @default.
• W2983843017 hasConcept C3018234147 @default.
• W2983843017 hasConcept C311688 @default.
• W2983843017 hasConcept C33923547 @default.
• W2983843017 hasConcept C38652104 @default.
• W2983843017 hasConcept C41008148 @default.
• W2983843017 hasConcept C62692426 @default.
• W2983843017 hasConcept C63553672 @default.
• W2983843017 hasConcept C80899671 @default.
• W2983843017 hasConceptScore W2983843017C11413529 @default.
• W2983843017 hasConceptScore W2983843017C114614502 @default.
• W2983843017 hasConceptScore W2983843017C118615104 @default.
• W2983843017 hasConceptScore W2983843017C120373497 @default.
• W2983843017 hasConceptScore W2983843017C125583679 @default.
• W2983843017 hasConceptScore W2983843017C132525143 @default.
• W2983843017 hasConceptScore W2983843017C138843760 @default.
• W2983843017 hasConceptScore W2983843017C152043487 @default.
• W2983843017 hasConceptScore W2983843017C3018234147 @default.
• W2983843017 hasConceptScore W2983843017C311688 @default.
• W2983843017 hasConceptScore W2983843017C33923547 @default.
• W2983843017 hasConceptScore W2983843017C38652104 @default.
• W2983843017 hasConceptScore W2983843017C41008148 @default.
• W2983843017 hasConceptScore W2983843017C62692426 @default.
• W2983843017 hasConceptScore W2983843017C63553672 @default.
• W2983843017 hasConceptScore W2983843017C80899671 @default.
• W2983843017 hasIssue "3" @default.

• next