Is there a recursive-cuts generalization of min cut/max flow for scale free graphs?
intuition is that you will get a property that degrades gracefully as you prune graph from higher to lower res.
-
-
so how fast the min-cut/max-flow will change is bound by the size of the prune, so in this sense it already has the property
-
so...basically tighten that bound as a function of what is pruned. Capillary prunes should matter less than arterial prunes.
- 1 more reply
New conversation -
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.