Files in this item

FilesDescriptionFormat

application/pdf

application/pdfSHANKARNARAYANAN-THESIS-2021.pdf (597kB)
(no description provided)PDF

Description

Title:Complexity of Dyck-reachability in directed graphs
Author(s):Shankar Narayanan, Aditya
Advisor(s):Viswanathan, Mahesh
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):Complexity
Context-Free Language
Dyck Reachability
Graphs
Abstract: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 concatenating the edge labels of the path is a member of the Dyck language, i.e., the language of balanced parentheses. We present previous works on upper bounds in Dyck-reachability in graphs and the equivalent formulation of the problem in the context of Recursive State Machines. We also present known lower bounds for the Dyck-reachability problem and the conditional reduction to Boolean Matrix Multiplication as well as the k-clique problem. Finally, we give a linear-time algorithm that computes st-Dyck-reachability for graphs with bounded treewidth and using a bounded stack.
Issue Date:2021-04-26
Type:Thesis
URI:http://hdl.handle.net/2142/110563
Rights Information:Copyright 2021 Aditya Shankar Narayanan
Date Available in IDEALS:2021-09-17
Date Deposited:2021-05


This item appears in the following Collection(s)

Item Statistics