Matches in SemOpenAlex for { <https://semopenalex.org/work/W3113400213> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W3113400213 endingPage "272" @default.
- W3113400213 startingPage "255" @default.
- W3113400213 abstract "In this paper we show a deterministic parallel all-pairs shortest paths algorithm for real-weighted directed graphs. The algorithm has $tilde{O}(nm+(n/d)^3)$ work and $tilde{O}(d)$ depth for any depth parameter $din [1,n]$. To the best of our knowledge, such a trade-off has only been previously described for the real-weighted single-source shortest paths problem using randomization [Bringmann et al., ICALP'17]. Moreover, our result improves upon the parallelism of the state-of-the-art randomized parallel algorithm for computing transitive closure, which has $tilde{O}(nm+n^3/d^2)$ work and $tilde{O}(d)$ depth [Ullman and Yannakakis, SIAM J. Comput. '91]. Our APSP algorithm turns out to be a powerful tool for designing efficient planar graph algorithms in both parallel and sequential regimes. One notable ingredient of our parallel APSP algorithm is a simple deterministic $tilde{O}(nm)$-work $tilde{O}(d)$-depth procedure for computing $tilde{O}(n/d)$-size hitting sets of shortest $d$-hop paths between all pairs of vertices of a real-weighted digraph. Such hitting sets have also been called $d$-hub sets. Hub sets have previously proved especially useful in designing parallel or dynamic shortest paths algorithms and are typically obtained via random sampling. Our procedure implies, for example, an $tilde{O}(nm)$-time deterministic algorithm for finding a shortest negative cycle of a real-weighted digraph. Such a near-optimal bound for this problem has been so far only achieved using a randomized algorithm [Orlin et al., Discret. Appl. Math. '18]." @default.
- W3113400213 created "2021-01-05" @default.
- W3113400213 creator A5025494465 @default.
- W3113400213 creator A5088982819 @default.
- W3113400213 date "2021-01-10" @default.
- W3113400213 modified "2023-09-24" @default.
- W3113400213 title "A Deterministic Parallel APSP Algorithm and its Applications" @default.
- W3113400213 hasPublicationYear "2021" @default.
- W3113400213 type Work @default.
- W3113400213 sameAs 3113400213 @default.
- W3113400213 citedByCount "3" @default.
- W3113400213 countsByYear W31134002132021 @default.
- W3113400213 countsByYear W31134002132022 @default.
- W3113400213 crossrefType "proceedings-article" @default.
- W3113400213 hasAuthorship W3113400213A5025494465 @default.
- W3113400213 hasAuthorship W3113400213A5088982819 @default.
- W3113400213 hasConcept C11413529 @default.
- W3113400213 hasConcept C114614502 @default.
- W3113400213 hasConcept C118615104 @default.
- W3113400213 hasConcept C120373497 @default.
- W3113400213 hasConcept C128669082 @default.
- W3113400213 hasConcept C128896722 @default.
- W3113400213 hasConcept C132525143 @default.
- W3113400213 hasConcept C13533509 @default.
- W3113400213 hasConcept C146380142 @default.
- W3113400213 hasConcept C22590252 @default.
- W3113400213 hasConcept C2779145032 @default.
- W3113400213 hasConcept C33923547 @default.
- W3113400213 hasConcept C36686422 @default.
- W3113400213 hasConceptScore W3113400213C11413529 @default.
- W3113400213 hasConceptScore W3113400213C114614502 @default.
- W3113400213 hasConceptScore W3113400213C118615104 @default.
- W3113400213 hasConceptScore W3113400213C120373497 @default.
- W3113400213 hasConceptScore W3113400213C128669082 @default.
- W3113400213 hasConceptScore W3113400213C128896722 @default.
- W3113400213 hasConceptScore W3113400213C132525143 @default.
- W3113400213 hasConceptScore W3113400213C13533509 @default.
- W3113400213 hasConceptScore W3113400213C146380142 @default.
- W3113400213 hasConceptScore W3113400213C22590252 @default.
- W3113400213 hasConceptScore W3113400213C2779145032 @default.
- W3113400213 hasConceptScore W3113400213C33923547 @default.
- W3113400213 hasConceptScore W3113400213C36686422 @default.
- W3113400213 hasLocation W31134002131 @default.
- W3113400213 hasOpenAccess W3113400213 @default.
- W3113400213 hasPrimaryLocation W31134002131 @default.
- W3113400213 hasRelatedWork W1511278436 @default.
- W3113400213 hasRelatedWork W1556485156 @default.
- W3113400213 hasRelatedWork W1990678352 @default.
- W3113400213 hasRelatedWork W2040011014 @default.
- W3113400213 hasRelatedWork W2044112344 @default.
- W3113400213 hasRelatedWork W2144068282 @default.
- W3113400213 hasRelatedWork W2156431918 @default.
- W3113400213 hasRelatedWork W2608368984 @default.
- W3113400213 hasRelatedWork W2796741022 @default.
- W3113400213 hasRelatedWork W2884021615 @default.
- W3113400213 hasRelatedWork W2897112965 @default.
- W3113400213 hasRelatedWork W2943735369 @default.
- W3113400213 hasRelatedWork W2951116199 @default.
- W3113400213 hasRelatedWork W2963015907 @default.
- W3113400213 hasRelatedWork W2964070308 @default.
- W3113400213 hasRelatedWork W2972297532 @default.
- W3113400213 hasRelatedWork W3016774877 @default.
- W3113400213 hasRelatedWork W3080296509 @default.
- W3113400213 hasRelatedWork W3208513294 @default.
- W3113400213 hasRelatedWork W2164942104 @default.
- W3113400213 isParatext "false" @default.
- W3113400213 isRetracted "false" @default.
- W3113400213 magId "3113400213" @default.
- W3113400213 workType "article" @default.