The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Marco Bressan 0002, Matthias Lanzinger, Marc Roth. The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. In Barna Saha, Rocco A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023. pages 542-552, ACM, 2023. [doi]

This author has not been identified. Look up 'Marco Bressan 0002' in GoogleThis author has not been identified. Look up 'Matthias Lanzinger' in GoogleThis author has not been identified. Look up 'Marc Roth' in Google

runs on WebDSL