On the complexity of triangle counting using emptiness queries

DOI10.4230/LIPICS.APPROX/RANDOM.2023.48MaRDI QIDQ6663065zbMATH OpenFDO

Authors Arijit Bishnu, Arijit Ghosh, Gopinath Mishra

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.48

zbMATH Keywords

bipartite independent set queryemptiness queriestriangle counting

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

This page was built for publication: On the complexity of triangle counting using emptiness queries

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