Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

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

From MaRDI portal
Publication:2397609
Jump to:navigation, search

DOI10.1016/J.TCS.2016.06.036zbMATH Open1370.68121OpenAlexW2483265632MaRDI QIDQ2397609FDOQ2397609


Authors: Graham Cormode, Hossein Jowhari Edit this on Wikidata


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




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?


Mathematics Subject Classification ID

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



Cited In (3)

  • A second look at counting triangles in graph streams (corrected)
  • Towards Optimal Moment Estimation in Streaming and Distributed Models
  • Title not available (Why is that?)





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2397609&oldid=15041367"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 19:56. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki