# Tag Info

1 vote
Accepted

### Efficient algorithm to count number of intersections of n sets

Assuming you really need the number for all pairs of sets and hearing that we are thinking of users in communities you could use the following algorithm which relies on the idea that the the average ...
• 1,106
1 vote
Accepted

### safe edge theorem proof clarification

Although correct, that statement, "$w(T') = w(T) - w(x,y) + w(u,v) \le w(T)$" alone is indeed confusing, since it leaves the impression that $w(T')$ might be smaller than $w(T)$. Well, the ...
• 34.1k

Only top scored, non community-wiki answers of a minimum length are eligible