The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree

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]

Abstract

Abstract is missing.