Cargando…
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
Treewidth is one of the most prominent structural parameters. While numerous theoretical results establish tractability under the assumption of fixed treewidth, the practical success of exploiting this parameter is far behind what theoretical runtime bounds have promised. In particular, a naive appl...
Autores principales: | Hecher, Markus, Thier, Patrick, Woltran, Stefan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326546/ http://dx.doi.org/10.1007/978-3-030-51825-7_25 |
Ejemplares similares
-
On the Treewidths of Graphs of Bounded Degree
por: Song, Yinglei, et al.
Publicado: (2015) -
Counting Linear Extensions: Parameterizations by Treewidth
por: Eiben, E., et al.
Publicado: (2018) -
Treewidth-based algorithms for the small parsimony problem on networks
por: Scornavacca, Celine, et al.
Publicado: (2022) -
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
por: Slivovsky, Friedrich, et al.
Publicado: (2020) -
Benchmarking treewidth as a practical component of tensor network simulations
por: Dumitrescu, Eugene F., et al.
Publicado: (2018)