Computing Tree-Depth Faster Than $$2^{n}$$ 2 n
Crossref DOI link: https://doi.org/10.1007/s00453-014-9914-4
Published Online: 2014-07-15
Published Print: 2015-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Fomin, Fedor V.
Giannopoulou, Archontia C.
Pilipczuk, MichaĆ
Text and Data Mining valid from 2014-07-15