Estimating Clustering Indexes in Data Streams

DOI10.1007/978-3-540-75520-3_55zbMath1151.68744OpenAlexW1508887260MaRDI QIDQ3527252

Christian Sohler, Luciana S. Buriol, Gereon Frahling, Stefano Leonardi

Publication date: 25 September 2008

Published in: Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_55

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory ⋮ New bounds for the CLIQUE-GAP problem using graph decomposition theory ⋮ Clique Counting in MapReduce ⋮ Efficient computation of the Weighted Clustering Coefficient

This page was built for publication: Estimating Clustering Indexes in Data Streams