Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs
Crossref DOI link: https://doi.org/10.1007/s10878-021-00703-7
Published Online: 2021-05-17
Published Print: 2021-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Liu, Ke
Lu, Mei http://orcid.org/0000-0001-9461-0640
Funding for this research was provided by:
National Natural Science Foundation of China (11771247, 11971158)
Tsinghua University Initiative Scientific Research Program
Text and Data Mining valid from 2021-05-01
Version of Record valid from 2021-05-01
Article History
Accepted: 19 January 2021
First Online: 17 May 2021