A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Crossref DOI link: https://doi.org/10.1007/s00453-019-00633-1
Published Online: 2019-10-03
Published Print: 2020-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kangas, Kustaa
Koivisto, Mikko http://orcid.org/0000-0001-9662-3605
Salonen, Sami
Funding for this research was provided by:
Academy of Finland (276864, 316771)
Text and Data Mining valid from 2019-10-03
Version of Record valid from 2019-10-03
Article History
Received: 30 November 2018
Accepted: 17 September 2019
First Online: 3 October 2019