scientific article; zbMATH DE number 6862103

DOI10.4230/LIPIcs.STACS.2017.11zbMath1402.68137MaRDI QIDQ4636608

Suman K. Bera, Amit Chakrabarti

Publication date: 19 April 2018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundsgraph algorithmstrianglessubgraph countingdata streaming

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

Graph sketching and streaming: new approaches for analyzing massive graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling ⋮ Optimal lower bounds for matching and vertex cover in dynamic graph streams

This page was built for publication: