Faster Subgraph Counting in Sparse Graphs

DOI10.4230/LIPIcs.IPEC.2019.6OpenAlexW2997331349MaRDI QIDQ5875538

Marco Bressan

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2019.6

zbMATH Keywords

tree decompositiondegeneracysubgraph counting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Faster algorithms for counting subgraphs in sparse graphs

This page was built for publication: Faster Subgraph Counting in Sparse Graphs