scientific article; zbMATH DE number 2119719

zbMATH Open1094.68601MaRDI QIDQ4828992FDOQ4828992

Authors: Ziv Bar-Yossef, Ravi Kumar, D. Sivakumar 

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

Recommendations

• Computing and Combinatorics
• How hard is counting triangles in the streaming model?
• A second look at counting triangles in graph streams
• Triangle counting in dynamic graph streams
• Efficient triangle counting in large graphs via degree-based vertex partitioning

zbMATH Keywords

list-efficient streaming algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cited In (34)

• New results for finding common neighborhoods in massive graphs in the data stream model
• Depth First Search in the Semi-streaming Model
• On triangle estimation using tripartite independent set queries
• On graph problems in a semi-streaming model
• A second look at counting triangles in graph streams (corrected)
• Counting Triangles under Updates in Worst-Case Optimal Time
• Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
• Adapting parallel algorithms to the W-stream model, with applications to graph problems
• Optimal sampling from sliding windows
• Title not available (Why is that?)
• Main-memory triangle computations for very large (sparse (power-law)) graphs
• Title not available (Why is that?)
• Structural results on matching estimation with applications to streaming
• Drawing trees in a streaming model
• Efficient optimally lazy algorithms for minimal-interval semantics
• How to catch \(L_2\)-heavy-hitters on sliding windows
• Title not available (Why is that?)
• New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory
• Triangle counting in dynamic graph streams
• A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
• Colorful triangle counting and a \textsc{MapReduce} implementation
• Clique counting in MapReduce: algorithms and experiments
• Efficient transformations for Klee's measure problem in the streaming model
• Two improved range-efficient algorithms for \(F_0\) estimation
• Model counting meets \(F_0\) estimation
• Intractability of min- and max-cut in streaming graphs
• A second look at counting triangles in graph streams
• Approximately Counting Triangles in Sublinear Time
• Finding Articulation Points of Large Graphs in Linear Time
• New bounds for the CLIQUE-GAP problem using graph decomposition theory
• Sublinear-time algorithms for counting star subgraphs via edge sampling
• Parameterized aspects of triangle enumeration
• Approximate set union via approximate randomization
• Approximate set union via approximate randomization

This page was built for publication:

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