Planted bipartite graph detection

DOI10.1109/TIT.2024.3382228MaRDI QIDQ6576610zbMATH OpenFDO

Authors Asaf Rotenberg, Wasim Huleihel, Ofer Shayevitz

Publication date 23 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2024.3382228

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(1)

• Counting stars is constant-degree optimal for detecting any planted subgraph

This page was built for publication: Planted bipartite graph detection

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