Corrigendum to: ``A second look at counting triangles in graph streams

DOI10.1016/J.TCS.2016.06.036MaRDI QIDQ2397609zbMATH OpenOpenAlexFDO

Authors Graham Cormode, Hossein Jowhari

Publication date 22 May 2017

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.06.036

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• A second look at counting triangles in graph streams (corrected)
• A second look at counting triangles in graph streams
• Computing and Combinatorics
• How hard is counting triangles in the streaming model?

Cited in

(3)

• A second look at counting triangles in graph streams (corrected)
• Towards Optimal Moment Estimation in Streaming and Distributed Models
• scientific article; zbMATH DE number 6862103 (Why is no real title available?)

This page was built for publication: Corrigendum to: ``A second look at counting triangles in graph streams

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