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
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 ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
graphs × 4495algorithms × 2055
shortest-path × 452
complexity-theory × 387
graph-traversal × 324
weighted-graphs × 255
trees × 236
optimization × 224
np-complete × 211
minimum-spanning-tree × 167
network-flow × 162
data-structures × 153
time-complexity × 146
algorithm-analysis × 137
combinatorics × 114
search-algorithms × 110
np-hard × 105
dag × 98
approximation × 97
spanning-trees × 97
colorings × 94
reductions × 92
bipartite-matching × 88
terminology × 85
reference-request × 81