Corpus ID: 1747786

Width, depth and space

@article{Chen2016WidthDA,
  title={Width, depth and space},
  author={Li-Hsuan Chen and Felix Reidl and Peter Rossmanith and Fernando S{\'a}nchez Villaamil},
  journal={ArXiv},
  year={2016},
  volume={abs/1607.00945}
}
  • Li-Hsuan Chen, Felix Reidl, +1 author Fernando Sánchez Villaamil
  • Published in ArXiv 2016
  • Mathematics, Computer Science
  • The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this additional structure. On the negative side, we show that every dynamic programming algorithm on treedepth decompositions of depth~$t$ cannot solve Dominating Set… CONTINUE READING
    1
    Twitter Mention

    Citations

    Publications citing this paper.

    References

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

    Fixed-Parameter Tractability of Treewidth and Pathwidth

    • Hans L. Bodlaender
    • Mathematics, Computer Science
    • The Multivariate Algorithmic Revolution and Beyond
    • 2012

    Sparsity: Graphs, Structures, and Algorithms, volume 28 of Algorithms and Combinatorics

    • J Nešetřil, P Ossona, Mendez
    • Sparsity: Graphs, Structures, and Algorithms, volume 28 of Algorithms and Combinatorics
    • 2012
    VIEW 2 EXCERPTS

    Algorithmic paradigms through the parameterized lens Space saving by dynamic algebraization . In Lect

    • J. Nederlof Drucker
    • 2010

    Saving space by algebraization

    VIEW 1 EXCERPT