scientific article; zbMATH DE number 7788476

DOI10.5555/3458064.3458202MaRDI QIDQ6147393zbMATH OpenFDO

Authors Suman K. Bera, Noujan Pashanasangi, C. Seshadhri

Publication date 15 January 2024

Full work available at URL https://arxiv.org/abs/2010.08083

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Counting subgraphs in somewhere dense graphs
• Subgraph enumeration in optimal I/O complexity
• A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs
• Partition constraints for conjunctive queries: bounds and worst-case optimal joins
• Subgraph counting in subquadratic time for bounded degeneracy graphs

This page was built for publication:

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