18 citations · 100 across the 28 of their papers we have counts for
35 papers
Parameter-Free Triangle Counting
Asaf Etgar, Anna Gilbert, Quanquan Liu +1
Given an undirected, unweighted graph with vertices and edges, the triangle counting problem seeks the number of three-cycles in it. Triangle and subgraph count…
Scalable Triangle Counting: The Threshold Algorithm
Asaf Etgar, Anna Gilbert, Quanquan C. Liu +1
We study one-pass triangle counting on random-order edge streams. We present a remarkably simple algorithm---read edges from the stream until triangles are observed in the pref…
Matchings via Random Greedy Independent Set: A Simpler Algorithm and Analysis
Andrew McGregor
We show that a simple extension of the randomized greedy maximal independent set algorithm yields a constant approximation for the maximum matching problem. The algorithm is a simp…
Tight Approximations for Graphical House Allocation
Hadi Hosseini, Andrew McGregor, Rik Sengupta +2
The Graphical House Allocation problem asks: how can houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph , so as to minimize the…
Improving the Efficiency of the PC Algorithm by Using Model-Based Conditional Independence Tests
Erica Cai, Andrew McGregor, David Jensen
Learning causal structure is useful in many areas of artificial intelligence, including planning, robotics, and explanation. Constraint-based structure learning algorithms such as…
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries
Raghavendra Addanki, Andrew McGregor, Cameron Musco
We study the problem of estimating the number of edges in an -vertex graph, accessed via the Bipartite Independent Set query model introduced by Beame et al. (ITCS '18). In this…