1 code implementation • 7 Feb 2018 • Federico D'Ambrosio, Gerard T. Barkema, Hans L. Bodlaender
We show that for any distribution, combining a tree structure with the Acceptance-Rejection method, we have an expected time of sampling and update of $O\left(\log\log{r_{max}}/{r_{min}}\right)$ is possible, where $r_{max}$ is the maximum rate and $r_{min}$ the minimum rate.
Computational Engineering, Finance, and Science Data Structures and Algorithms G.3
1 code implementation • 7 Nov 2012 • Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
It is well known that many local graph problems, like Vertex Cover and Dominating Set, can be solved in 2^{O(tw)}|V|^{O(1)} time for graphs G=(V, E) with a given tree decomposition of width tw.
Data Structures and Algorithms Computational Complexity Discrete Mathematics F.2.2; G.2.8
