1,095 research outputs found
Fine-Grained Complexity of Regular Path Queries
A regular path query (RPQ) is a regular expression q that returns all node pairs (u, v) from a graph database that are connected by an arbitrary path labelled with a word from L(q). The obvious algorithmic approach to RPQ evaluation (called PG-approach), i. e., constructing the product graph between an NFA for q and the graph database, is appealing due to its simplicity and also leads to efficient algorithms. However, it is unclear whether the PG-approach is optimal. We address this question by thoroughly investigating which upper complexity bounds can be achieved by the PG-approach, and we complement these with conditional lower bounds (in the sense of the fine-grained complexity framework). A special focus is put on enumeration and delay bounds, as well as the data complexity perspective. A main insight is that we can achieve optimal (or near optimal) algorithms with the PG-approach, but the delay for enumeration is rather high (linear in the database). We explore three successful approaches towards enumeration with sub-linear delay: super-linear preprocessing, approximations of the solution sets, and restricted classes of RPQs
Levelable Sets and the Algebraic Structure of Parameterizations
Asking which sets are fixed-parameter tractable for a given parameterization
constitutes much of the current research in parameterized complexity theory.
This approach faces some of the core difficulties in complexity theory. By
focussing instead on the parameterizations that make a given set
fixed-parameter tractable, we circumvent these difficulties. We isolate
parameterizations as independent measures of complexity and study their
underlying algebraic structure. Thus we are able to compare parameterizations,
which establishes a hierarchy of complexity that is much stronger than that
present in typical parameterized algorithms races. Among other results, we find
that no practically fixed-parameter tractable sets have optimal
parameterizations
- …