The complexity of average-case dynamic subgraph counting

DOI10.1137/1.9781611977073.23MaRDI QIDQ6575095zbMATH OpenFDO

Authors Monika R. Henzinger, Andrea Lincoln, Barna Saha

Publication date 19 July 2024

Full work available at URL https://doi.org/10.1137/1.9781611977073.23

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Low recourse arborescence forests under uniformly random arcs
• Fine-grained complexity lower bounds for families of dynamic graphs

This page was built for publication: The complexity of average-case dynamic subgraph counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575095)