Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph
Crossref DOI link: https://doi.org/10.1007/s00453-018-0511-9
Published Online: 2018-09-05
Published Print: 2019-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Patel, Viresh
Regts, Guus
Funding for this research was provided by:
Nederlandse Organisatie voor Wetenschappelijk Onderzoek (024.002.003)
Text and Data Mining valid from 2018-09-05
Article History
Received: 21 July 2017
Accepted: 27 August 2018
First Online: 5 September 2018