The complexity of pattern counting in directed graphs, parameterised by the outdegree

From MaRDI portal

Publication:6499249

Jump to:navigation, search

DOI10.1145/3564246.3585204MaRDI QIDQ6499249

Marco Bressan, Marc Roth, Matthias Lanzinger

Publication date: 8 May 2024

zbMATH Keywords

parameterized complexity subgraph counting graph motifs pattern counting directed graph counting induced subgraph counting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: The complexity of pattern counting in directed graphs, parameterised by the outdegree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6499249&oldid=37961938"