Triangle counting in dynamic graph streams

DOI10.1007/978-3-319-08404-6_27MaRDI QIDQ6826362zbMATH OpenFDO

Authors Konstantin Kutzkov, Rasmus Pagh

Publication date 2 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08404-6_27

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

This page was built for publication: Triangle counting in dynamic graph streams

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