Finding cliques and dense subgraphs using edge queries

MaRDI QIDQ6454589zbMATH OpenFDO

Authors Endre Csóka, András Pongrácz

Publication date 10 October 2023

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20)

This page was built for publication: Finding cliques and dense subgraphs using edge queries

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