Computing and Combinatorics

DOI10.1007/11533719zbMath1128.05317OpenAlexW4376561447MaRDI QIDQ5716993

Hossein Jowhari, Mohammad Ghodsi

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11533719

Mathematics Subject Classification ID

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

Related Items

On triangle estimation using tripartite independent set queries ⋮ Triangle counting in dynamic graph streams ⋮ A second look at counting triangles in graph streams (corrected) ⋮ New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory ⋮ Approximately Counting Triangles in Sublinear Time ⋮ Colorful triangle counting and a \textsc{MapReduce} implementation ⋮ Optimal sampling from sliding windows ⋮ Intractability of min- and max-cut in streaming graphs ⋮ On Approximating the Number of $k$-Cliques in Sublinear Time ⋮ New bounds for the CLIQUE-GAP problem using graph decomposition theory ⋮ Unnamed Item ⋮ Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ A second look at counting triangles in graph streams ⋮ A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling ⋮ Counting Triangles under Updates in Worst-Case Optimal Time ⋮ Clique Counting in MapReduce