no code implementations • 17 Jan 2021 • Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$.
Data Structures and Algorithms Discrete Mathematics 05C85, 68R10 G.2.2; F.2.2
no code implementations • 5 Apr 2018 • Dariusz Dereniowski, Stefan Tiegel, Przemysław Uznański, Daniel Wolleb-Graf
We then show that our algorithm coupled with Chernoff bound argument leads to an algorithm for independent noise that is simpler and with a query complexity that is both simpler and asymptotically better to one of Emamjomeh-Zadeh et al. [STOC 2016].
