AbstractWe generalize the concept of tree-width to directed graphs and prove that every directed graph with no “haven” of large order has small tree-width. Conversely, a digraph with a large haven has large tree-width. We also show that the Hamilton cycle problem and other NP-hard problems can be solved in polynomial time when restricted to digraphs of bounded tree-width
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the fi...
Abstract. Tree-width is a well-known metric on undirected graphs that mea-sures how tree-like a grap...
In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these...
AbstractIn [T. Johnson, N. Robertson, P.D. Seymour, R. Thomas, Directed tree-width, J. Combin. Theor...
AbstractTree-width is a well-known metric on undirected graphs that measures how tree-like a graph i...
AbstractIn [T. Johnson, N. Robertson, P.D. Seymour, R. Thomas, Directed tree-width, J. Combin. Theor...
AbstractGraph decompositions such as tree-decompositions and associated width measures have been the...
AbstractWe place our focus on the gap between treewidth’s success in producing fixed-parameter polyn...
AbstractWe consider various well-known, equivalent complexity measures for graphs such as eliminatio...
AbstractKelly-width is a parameter of digraphs recently proposed by Hunter and Kreutzer as a directe...
AbstractTree-width is a well-known metric on undirected graphs that measures how tree-like a graph i...
AbstractWe place our focus on the gap between treewidth’s success in producing fixed-parameter polyn...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the fi...
Abstract. Tree-width is a well-known metric on undirected graphs that mea-sures how tree-like a grap...
In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these...
AbstractIn [T. Johnson, N. Robertson, P.D. Seymour, R. Thomas, Directed tree-width, J. Combin. Theor...
AbstractTree-width is a well-known metric on undirected graphs that measures how tree-like a graph i...
AbstractIn [T. Johnson, N. Robertson, P.D. Seymour, R. Thomas, Directed tree-width, J. Combin. Theor...
AbstractGraph decompositions such as tree-decompositions and associated width measures have been the...
AbstractWe place our focus on the gap between treewidth’s success in producing fixed-parameter polyn...
AbstractWe consider various well-known, equivalent complexity measures for graphs such as eliminatio...
AbstractKelly-width is a parameter of digraphs recently proposed by Hunter and Kreutzer as a directe...
AbstractTree-width is a well-known metric on undirected graphs that measures how tree-like a graph i...
AbstractWe place our focus on the gap between treewidth’s success in producing fixed-parameter polyn...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
In the last decades, considerable efforts have been spent to characterize what makes NP-hard problem...
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the most important tools in the fi...
Abstract. Tree-width is a well-known metric on undirected graphs that mea-sures how tree-like a grap...
In cops and robber games a number of cops tries to capture a robber in a graph. A variant of these...
DOI
Add to ORKG