Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Dyck Reachability"”.
-
Complexity of Dyck-reachability in directed graphs
We study the problem of Dyck-reachability in directed graphs de ned as follows: given a directed graph with edges labeled by either open or close parentheses, we claim that a vertex is Dyck-reachable from another if there is a path between these two vertices such that the string described by …