Crossmark

On the Complexity of Computing Treebreadth

Crossref DOI link: https://doi.org/10.1007/s00453-019-00657-7

Published Online: 2019-12-12

Published Print: 2020-06

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Ducoffe, Guillaume

Legay, Sylvain

Nisse, Nicolas
License Information

Text and Data Mining valid from 2019-12-12

Version of Record valid from 2019-12-12
More Information

Article History

Received: 19 September 2017

Accepted: 1 December 2019

First Online: 12 December 2019