Is there a recursive-cuts generalization of min cut/max flow for scale free graphs?
so...basically tighten that bound as a function of what is pruned. Capillary prunes should matter less than arterial prunes.
-
-
the capacities of the edges already encode this, that is the bound is already based on the max capacity of the cut vein
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.