Matches in SemOpenAlex for { <https://semopenalex.org/work/W3188066388> ?p ?o ?g. }
Showing items 1 to 98 of
98
with 100 items per page.
- W3188066388 abstract "A straightforward dynamic programming method for the single-source shortest paths problem (SSSP) in an edge-weighted directed acyclic graph (DAG) processes the vertices in a topologically sorted order. First, we similarly iterate this method alternatively in a breadth-first search sorted order and the reverse order on an input directed graph with both positive and negative real edge weights, $n$ vertices and $m$ edges. For a positive integer $t,$ after $O(t)$ iterations in $O(tm)$ time, we obtain for each vertex $v$ a path distance from the source to $v$ not exceeding that yielded by the shortest path from the source to $v$ among the so called {em$ t+$light paths}. A directed path between two vertices is $t+$light if it contains at most $t$ more edges than the minimum edge-cardinality directed path between these vertices. After $O(n)$ iterations, we obtain an $O(nm)$-time solution to SSSP in directed graphs with real edge weights matching that of Bellman and Ford. Our main result is an output-sensitive algorithm for the all-pairs shortest paths problem (APSP) in DAGs with positive and negative real edge weights. It runs in time $O(min {n^{omega}, nm+n^2log n}+sum_{vin V}text{indeg}(v)|text{leaf}(T_v)|),$ where $n$ is the number of vertices, $m$ is the number of edges, $omega$ is the exponent of fast matrix multiplication, $text{indeg}(v)$ stands for the indegree of $v,$ $T_v$ is a tree of lexicographically-first shortest directed paths from all ancestors of $v$ to $v$, and $text{leaf}(T_v)$ is the set of leaves in $T_v.$ Finally, we discuss an extension of hypothetical improved upper time-bounds for APSP in non-negatively edge-weighted DAGs to include directed graphs with a polynomial number of large directed cycles." @default.
- W3188066388 created "2021-08-16" @default.
- W3188066388 creator A5016509031 @default.
- W3188066388 creator A5058491421 @default.
- W3188066388 creator A5079578147 @default.
- W3188066388 date "2021-08-07" @default.
- W3188066388 modified "2023-10-11" @default.
- W3188066388 title "An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs" @default.
- W3188066388 cites W1641312805 @default.
- W3188066388 cites W1969573308 @default.
- W3188066388 cites W1987719024 @default.
- W3188066388 cites W2049500052 @default.
- W3188066388 cites W2093899598 @default.
- W3188066388 cites W2133768189 @default.
- W3188066388 cites W2140232587 @default.
- W3188066388 cites W2151021662 @default.
- W3188066388 cites W2169528473 @default.
- W3188066388 cites W2227557434 @default.
- W3188066388 cites W2263246245 @default.
- W3188066388 cites W2566091043 @default.
- W3188066388 cites W3116253690 @default.
- W3188066388 cites W3138807513 @default.
- W3188066388 cites W3145128584 @default.
- W3188066388 hasPublicationYear "2021" @default.
- W3188066388 type Work @default.
- W3188066388 sameAs 3188066388 @default.
- W3188066388 citedByCount "0" @default.
- W3188066388 crossrefType "posted-content" @default.
- W3188066388 hasAuthorship W3188066388A5016509031 @default.
- W3188066388 hasAuthorship W3188066388A5058491421 @default.
- W3188066388 hasAuthorship W3188066388A5079578147 @default.
- W3188066388 hasConcept C105795698 @default.
- W3188066388 hasConcept C114614502 @default.
- W3188066388 hasConcept C118615104 @default.
- W3188066388 hasConcept C121332964 @default.
- W3188066388 hasConcept C132525143 @default.
- W3188066388 hasConcept C146380142 @default.
- W3188066388 hasConcept C159254197 @default.
- W3188066388 hasConcept C165064840 @default.
- W3188066388 hasConcept C17349429 @default.
- W3188066388 hasConcept C199360897 @default.
- W3188066388 hasConcept C22590252 @default.
- W3188066388 hasConcept C2777735758 @default.
- W3188066388 hasConcept C2779557605 @default.
- W3188066388 hasConcept C33923547 @default.
- W3188066388 hasConcept C41008148 @default.
- W3188066388 hasConcept C54385418 @default.
- W3188066388 hasConcept C62520636 @default.
- W3188066388 hasConcept C74197172 @default.
- W3188066388 hasConcept C80899671 @default.
- W3188066388 hasConcept C84114770 @default.
- W3188066388 hasConceptScore W3188066388C105795698 @default.
- W3188066388 hasConceptScore W3188066388C114614502 @default.
- W3188066388 hasConceptScore W3188066388C118615104 @default.
- W3188066388 hasConceptScore W3188066388C121332964 @default.
- W3188066388 hasConceptScore W3188066388C132525143 @default.
- W3188066388 hasConceptScore W3188066388C146380142 @default.
- W3188066388 hasConceptScore W3188066388C159254197 @default.
- W3188066388 hasConceptScore W3188066388C165064840 @default.
- W3188066388 hasConceptScore W3188066388C17349429 @default.
- W3188066388 hasConceptScore W3188066388C199360897 @default.
- W3188066388 hasConceptScore W3188066388C22590252 @default.
- W3188066388 hasConceptScore W3188066388C2777735758 @default.
- W3188066388 hasConceptScore W3188066388C2779557605 @default.
- W3188066388 hasConceptScore W3188066388C33923547 @default.
- W3188066388 hasConceptScore W3188066388C41008148 @default.
- W3188066388 hasConceptScore W3188066388C54385418 @default.
- W3188066388 hasConceptScore W3188066388C62520636 @default.
- W3188066388 hasConceptScore W3188066388C74197172 @default.
- W3188066388 hasConceptScore W3188066388C80899671 @default.
- W3188066388 hasConceptScore W3188066388C84114770 @default.
- W3188066388 hasLocation W31880663881 @default.
- W3188066388 hasOpenAccess W3188066388 @default.
- W3188066388 hasPrimaryLocation W31880663881 @default.
- W3188066388 hasRelatedWork W115237389 @default.
- W3188066388 hasRelatedWork W1504891601 @default.
- W3188066388 hasRelatedWork W1530560842 @default.
- W3188066388 hasRelatedWork W1566918731 @default.
- W3188066388 hasRelatedWork W1823654214 @default.
- W3188066388 hasRelatedWork W1980889962 @default.
- W3188066388 hasRelatedWork W1986208679 @default.
- W3188066388 hasRelatedWork W1994717376 @default.
- W3188066388 hasRelatedWork W1998002108 @default.
- W3188066388 hasRelatedWork W2028750248 @default.
- W3188066388 hasRelatedWork W2038084411 @default.
- W3188066388 hasRelatedWork W2079318435 @default.
- W3188066388 hasRelatedWork W2124060078 @default.
- W3188066388 hasRelatedWork W2166444590 @default.
- W3188066388 hasRelatedWork W2775875721 @default.
- W3188066388 hasRelatedWork W2920165356 @default.
- W3188066388 hasRelatedWork W2950574735 @default.
- W3188066388 hasRelatedWork W2950691094 @default.
- W3188066388 hasRelatedWork W3196868644 @default.
- W3188066388 hasRelatedWork W66906462 @default.
- W3188066388 isParatext "false" @default.
- W3188066388 isRetracted "false" @default.
- W3188066388 magId "3188066388" @default.
- W3188066388 workType "article" @default.