Computing and Combinatorics

DOI10.1007/11533719zbMath1128.05317MaRDI 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

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

Related Items

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