Matches in SemOpenAlex for { <https://semopenalex.org/work/W2022086557> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2022086557 abstract "We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges.(MATH) For the problem of transitive closure, the previous best known algorithms, for achieving O(1) query time, require O(min(m, frac{n^3}{m}))$ amortized update time, implying an upper bound of O(n^{frac{3}{2}})$ on update time per edge-deletion. We present an algorithm that achieves $O(1)$ query time and O(n log^2n + frac{n^2}{sqrt{m}}{sqrt{log n}})$ update time per edge-deletion, thus improving the upper bound to O(n^{frac{4}{3}}sqrt[3]{log n})$.(MATH) For the problem of maintaining all-pairs shortest distances in unweighted digraph under deletion of edges, we present an algorithm that requires O(frac{n^3}{m} log^2 n)$ amortized update time and answers a distance query in O(1) time. This improves the previous best known update bound by a factor of log n. For maintaining all-pairs shortest paths, we present an algorithm that achieves O(min(n^{frac{3}{2}} sqrt{log n}, frac{n^3}{m} log ^2n))$ amortized update time and reports a shortest path in optimal time (proportional to the length of the path). For the latter problem we improve the worst amortized update time bound by a factor of O(sqrt{frac{n}{log n}})$.(MATH) We also present the first decremental algorithm for maintaining all-pairs (1+e) approximate shortest paths/distances, for any e > 0, that achieves a sub-quadratic update time of O(n log2n + frac{n^2}{sqrt{epsilon m}}sqrt{log n})$ and optimal query time.Our algorithms are randomized and have one-sided error for query (with probability O(1/nc) for any constant c)." @default.
- W2022086557 created "2016-06-24" @default.
- W2022086557 creator A5033068215 @default.
- W2022086557 creator A5035109023 @default.
- W2022086557 creator A5059835930 @default.
- W2022086557 date "2002-05-19" @default.
- W2022086557 modified "2023-09-23" @default.
- W2022086557 title "Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths" @default.
- W2022086557 cites W1979740015 @default.
- W2022086557 cites W2136963423 @default.
- W2022086557 doi "https://doi.org/10.1145/509907.509928" @default.
- W2022086557 hasPublicationYear "2002" @default.
- W2022086557 type Work @default.
- W2022086557 sameAs 2022086557 @default.
- W2022086557 citedByCount "22" @default.
- W2022086557 countsByYear W20220865572012 @default.
- W2022086557 countsByYear W20220865572013 @default.
- W2022086557 countsByYear W20220865572014 @default.
- W2022086557 countsByYear W20220865572020 @default.
- W2022086557 crossrefType "proceedings-article" @default.
- W2022086557 hasAuthorship W2022086557A5033068215 @default.
- W2022086557 hasAuthorship W2022086557A5035109023 @default.
- W2022086557 hasAuthorship W2022086557A5059835930 @default.
- W2022086557 hasBestOaLocation W20220865572 @default.
- W2022086557 hasConcept C11413529 @default.
- W2022086557 hasConcept C114614502 @default.
- W2022086557 hasConcept C128896722 @default.
- W2022086557 hasConcept C129691609 @default.
- W2022086557 hasConcept C132525143 @default.
- W2022086557 hasConcept C146834321 @default.
- W2022086557 hasConcept C162324750 @default.
- W2022086557 hasConcept C191399111 @default.
- W2022086557 hasConcept C203776342 @default.
- W2022086557 hasConcept C22149727 @default.
- W2022086557 hasConcept C33923547 @default.
- W2022086557 hasConcept C34447519 @default.
- W2022086557 hasConcept C41008148 @default.
- W2022086557 hasConcept C80444323 @default.
- W2022086557 hasConceptScore W2022086557C11413529 @default.
- W2022086557 hasConceptScore W2022086557C114614502 @default.
- W2022086557 hasConceptScore W2022086557C128896722 @default.
- W2022086557 hasConceptScore W2022086557C129691609 @default.
- W2022086557 hasConceptScore W2022086557C132525143 @default.
- W2022086557 hasConceptScore W2022086557C146834321 @default.
- W2022086557 hasConceptScore W2022086557C162324750 @default.
- W2022086557 hasConceptScore W2022086557C191399111 @default.
- W2022086557 hasConceptScore W2022086557C203776342 @default.
- W2022086557 hasConceptScore W2022086557C22149727 @default.
- W2022086557 hasConceptScore W2022086557C33923547 @default.
- W2022086557 hasConceptScore W2022086557C34447519 @default.
- W2022086557 hasConceptScore W2022086557C41008148 @default.
- W2022086557 hasConceptScore W2022086557C80444323 @default.
- W2022086557 hasLocation W20220865571 @default.
- W2022086557 hasLocation W20220865572 @default.
- W2022086557 hasOpenAccess W2022086557 @default.
- W2022086557 hasPrimaryLocation W20220865571 @default.
- W2022086557 hasRelatedWork W1548215338 @default.
- W2022086557 hasRelatedWork W2127467227 @default.
- W2022086557 hasRelatedWork W2350182676 @default.
- W2022086557 hasRelatedWork W2359423766 @default.
- W2022086557 hasRelatedWork W2362009423 @default.
- W2022086557 hasRelatedWork W2364216866 @default.
- W2022086557 hasRelatedWork W2375463958 @default.
- W2022086557 hasRelatedWork W2394135826 @default.
- W2022086557 hasRelatedWork W2614633957 @default.
- W2022086557 hasRelatedWork W90346837 @default.
- W2022086557 isParatext "false" @default.
- W2022086557 isRetracted "false" @default.
- W2022086557 magId "2022086557" @default.
- W2022086557 workType "article" @default.