We study one-pass triangle counting on random-order edge streams. We present a remarkably simple algorithm---read edges from the stream until $Q$ triangles are observed in the prefix, then output $Q\,(m/S)^3$ where $S$ is the stopping length---and prove that, when the maximum number of triangles incident to any edge sa...
Asaf Etgar, A. Gilbert, Quan-Quan C. Liu et al.· 0 citations
Given an undirected, unweighted graph $G = (V,E)$ with $n$ vertices and $m$ edges, the triangle counting problem seeks the number of three-cycles in it. Triangle and subgraph counting are classical problems in graph algorithms, central to applications such as community detection, computing the clustering coefficient, m...
Asaf Etgar, A. Gilbert, Quan-Quan C. Liu et al.· 0 citations
This work implements a suite of algorithms, covering the literature and new methods, both with theoretical guarantees and heuristics, and evaluates their performance on real and synthetic data, both inherently non metric and corrupted, demonstrating that the algorithms' performance is determined predominantly by the ty...
This paper asks what structural properties of the graph itself make metric repair tractable, and gives pseudo-polynomial time algorithms for series-parallel graphs, and by generalization, graphs of bounded treewidth and a new algorithm for the length-bounded multicut problem.
Asaf Etgar, A. Gilbert, Jamie Tucker-Foltz· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
