An algorithmic metatheorem for directed treewidth

@article{Oliveira2016AnAM,
  title={An algorithmic metatheorem for directed treewidth},
  author={Mateus de Oliveira Oliveira},
  journal={ArXiv},
  year={2016},
  volume={abs/1410.0589}
}
  • Mateus de Oliveira Oliveira
  • Published in Discret. Appl. Math. 2016
  • Mathematics, Computer Science
  • ArXiv
  • The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some NP-complete properties such as Hamiltonicity can be decided in polynomial time on digraphs of constant directed treewidth. Nevertheless, despite more than one decade of intensive research, the list of hard combinatorial problems that are known to be solvable in… CONTINUE READING
    2
    Twitter Mentions

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 46 REFERENCES

    Directed Tree-Width

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    The Monadic Second-Order Logic of Graphs X: Linear Orderings

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    The dag-width of directed graphs

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Graph minors XX

    • N. Robertson, P. D. Seymour
    • Wagner’s conjecture. Journal of Combinatorial Theory, Series B, 92(2):325–357,
    • 2004
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Easy Problems for Tree-Decomposable Graphs

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    The Transitive Reduction of a Directed Graph

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Are there any good digraph width measures?

    Digraph Complexity Measures and Applications in Formal Language Theory

    • Hermann Gruber
    • Computer Science, Mathematics
    • Discret. Math. Theor. Comput. Sci.
    • 2012
    VIEW 3 EXCERPTS