Search Results

Exact string matching in labeled graphs is the problem of searching paths of a graph G=(V, E) such that the concatenation of their node labels is equal to a given pattern string P[1.m]. This basic problem can be found at the heart of more complex ...

The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. In this paper we perform a fine-grained analysis of the complexity of q-Coloring with respect to a hierarchy of structural parameters. ...

Conflict-free q-colouring of a graph G refers to the colouring of a subset of vertices of G using q colours such that every vertex has a neighbour of unique colour. In this paper, we study the Minimum Conflict-free q-Colouring problem. ...

Subset Sumand k-SAT are two of the most extensively studied problems in computer science, and conjectures about their hardness are among the cornerstones of fine-grained complexity. An important open problem in this area is to base the hardness of one of ...

We prove several tight results on the fine-grained complexity of approximating the diameter of a graph. First, we prove that, for any ε>0, assuming the Strong Exponential Time Hypothesis (SETH), there are no near-linear time 2−ε-approximation algorithms ...

Conflict free q-Colouring of a graph G refers to the colouring of a subset of vertices of G using q colours such that every vertex has a neighbour of unique colour. In this paper, we study the Minimum Conflict free q-Colouring problem. Given a ...

Hyperbolicity is a distance-based measure of how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms used ...

Assuming SETH, we cannot compute the number of reachable vertices in a digraph in O ( n 2 - ź ) .The same result holds if we restrict our attention to acyclic graphs.This result has consequences on the complexity of computing the transitive closure. In ...

We analyze several quadratic-time solvable problems, and we show that these problems are not solvable in truly subquadratic time (that is, in time O(n2- ) for some >0), unless the well known Strong Exponential Time Hypothesis (in short, SETH) is false. ...

The Workflow Satisfiability Problem (WSP) is a problem used in access control.The WSP is parameterized by the number of steps.The WSP is considered for regular and user-independent constraints.Tight lower bounds are proved for WSP algorithms with the ...

A Strong Exponential Time Hypothesis lower bound for resolution has the form 2 ( 1 - k ) n for some k-CNF on n variables such that k 0 as k ∞ . For every large k we prove that there exists an unsatisfiable k-CNF formula on n variables which requires ...

Motivated by practical applications, the Labeled Correlation Clustering problem, a variant of Correlation Clustering problem, is formally defined and studied in this paper. Since the problem is NP-complete, we consider the parameterized complexities. ...

The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time ...