Efficient testing of large graphs

DOI10.1109/SFFCS.1999.814642MaRDI QIDQ7238332zbMATH OpenFDO

Authors Noga Alon, Michael Krivelevich, Eldar Fischer, Mario Szegedy

Publication date 6 May 2026

Full work available at URL https://doi.org/10.1109/SFFCS.1999.814642

Mathematics Subject Classification ID

Graph theory (05Cxx) Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68Rxx) Nonnumerical algorithms (68W05) Quantum computation (81P68)

This page was built for publication: Efficient testing of large graphs

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