We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
Reachability is the problem of deciding whether there is a path from one vertex to the other in the ...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
Many combinatorial problems can be solved in time O^*(c^{tw}) on graphs of treewidth tw, for a probl...
We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and...
Many hard problems can be solved efficiently when the input is restricted to graphs of bounded treew...
Dynamic programming on path and tree decompositions of graphs is a technique that is ubiquitous in t...
Many combinatorial problems can be solved in time O^*(c^{tw}) on graphs of treewidth tw, for a probl...
In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
Reachability is the problem of deciding whether there is a path from one vertex to the other in the ...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
Many combinatorial problems can be solved in time O^*(c^{tw}) on graphs of treewidth tw, for a probl...
We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and...
Many hard problems can be solved efficiently when the input is restricted to graphs of bounded treew...
Dynamic programming on path and tree decompositions of graphs is a technique that is ubiquitous in t...
Many combinatorial problems can be solved in time O^*(c^{tw}) on graphs of treewidth tw, for a probl...
In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
We consider graphs with n nodes together with their tree-decomposition that has b = O ( n ) bags and...
Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard g...
DOI
Add to ORKG