Matches in SemOpenAlex for { <https://semopenalex.org/work/W2783940942> ?p ?o ?g. }
Showing items 1 to 78 of
78
with 100 items per page.
- W2783940942 abstract "Consider any two vertices in a weighted digraph. The exact path length problem is to determine if there is a path of a given fixed cost between these vertices. This paper focuses on the exact path problem for costs -1,0 or +1 between all pairs of vertices. This special case is also restricted to original edge weights from {-1, +1}. In this special case, this paper gives an O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>ω</sup> log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n) exact path solution, where ω is the best exponent for matrix multiplication. Basic variations of this algorithm determine which pairs of digraph nodes have Dyck or semi-Dyck labeled paths between them, assuming two terminals or parenthesis. Therefore, determining reachability for Dyck or semi-Dyck labeled paths costs O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>ω</sup> log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> n). Both the exact path and labeled path solutions can be improved by poly-log factors, but these improvements are not given here. To find Dyck or semi-Dyck reachability in a labeled digraph, each edge has a single symbol on it. A path label is made by concatenating all symbols along the path. Cycles are allowed without any repeated edges. These paths have the same number of balanced parenthesizations (semi-Dyck languages) or have an equal numbers of matching symbols (Dyck languages). The exact path length problem has many applications. These applications include the labeled path problems given here, which in turn, have many applications." @default.
- W2783940942 created "2018-01-26" @default.
- W2783940942 creator A5024240770 @default.
- W2783940942 date "2017-10-01" @default.
- W2783940942 modified "2023-10-17" @default.
- W2783940942 title "Efficient exact paths for dyck and semi-dyck labeled path reachability (extended abstract)" @default.
- W2783940942 cites W1823654214 @default.
- W2783940942 cites W1970052762 @default.
- W2783940942 cites W1979740015 @default.
- W2783940942 cites W1979867994 @default.
- W2783940942 cites W1982667848 @default.
- W2783940942 cites W1990051509 @default.
- W2783940942 cites W1996513497 @default.
- W2783940942 cites W2011824721 @default.
- W2783940942 cites W2024779397 @default.
- W2783940942 cites W2025063099 @default.
- W2783940942 cites W2030166143 @default.
- W2783940942 cites W2033356880 @default.
- W2783940942 cites W2038073775 @default.
- W2783940942 cites W2048541310 @default.
- W2783940942 cites W2049500052 @default.
- W2783940942 cites W2064982280 @default.
- W2783940942 cites W2070992781 @default.
- W2783940942 cites W2072985157 @default.
- W2783940942 cites W2077110643 @default.
- W2783940942 cites W2080540417 @default.
- W2783940942 cites W2089633648 @default.
- W2783940942 cites W2098278777 @default.
- W2783940942 cites W2120248756 @default.
- W2783940942 cites W2566432892 @default.
- W2783940942 cites W2569895586 @default.
- W2783940942 cites W2618199688 @default.
- W2783940942 cites W3157585079 @default.
- W2783940942 doi "https://doi.org/10.1109/uemcon.2017.8249039" @default.
- W2783940942 hasPublicationYear "2017" @default.
- W2783940942 type Work @default.
- W2783940942 sameAs 2783940942 @default.
- W2783940942 citedByCount "2" @default.
- W2783940942 countsByYear W27839409422022 @default.
- W2783940942 crossrefType "proceedings-article" @default.
- W2783940942 hasAuthorship W2783940942A5024240770 @default.
- W2783940942 hasConcept C11413529 @default.
- W2783940942 hasConcept C114614502 @default.
- W2783940942 hasConcept C118615104 @default.
- W2783940942 hasConcept C136643341 @default.
- W2783940942 hasConcept C199360897 @default.
- W2783940942 hasConcept C2777735758 @default.
- W2783940942 hasConcept C2779145032 @default.
- W2783940942 hasConcept C33923547 @default.
- W2783940942 hasConcept C41008148 @default.
- W2783940942 hasConcept C44359876 @default.
- W2783940942 hasConceptScore W2783940942C11413529 @default.
- W2783940942 hasConceptScore W2783940942C114614502 @default.
- W2783940942 hasConceptScore W2783940942C118615104 @default.
- W2783940942 hasConceptScore W2783940942C136643341 @default.
- W2783940942 hasConceptScore W2783940942C199360897 @default.
- W2783940942 hasConceptScore W2783940942C2777735758 @default.
- W2783940942 hasConceptScore W2783940942C2779145032 @default.
- W2783940942 hasConceptScore W2783940942C33923547 @default.
- W2783940942 hasConceptScore W2783940942C41008148 @default.
- W2783940942 hasConceptScore W2783940942C44359876 @default.
- W2783940942 hasLocation W27839409421 @default.
- W2783940942 hasOpenAccess W2783940942 @default.
- W2783940942 hasPrimaryLocation W27839409421 @default.
- W2783940942 hasRelatedWork W1900433022 @default.
- W2783940942 hasRelatedWork W1988301526 @default.
- W2783940942 hasRelatedWork W2130254085 @default.
- W2783940942 hasRelatedWork W2159377379 @default.
- W2783940942 hasRelatedWork W2783940942 @default.
- W2783940942 hasRelatedWork W2786655984 @default.
- W2783940942 hasRelatedWork W2963699585 @default.
- W2783940942 hasRelatedWork W3025390008 @default.
- W2783940942 hasRelatedWork W3083664609 @default.
- W2783940942 hasRelatedWork W398974528 @default.
- W2783940942 isParatext "false" @default.
- W2783940942 isRetracted "false" @default.
- W2783940942 magId "2783940942" @default.
- W2783940942 workType "article" @default.