Is there a recursive-cuts generalization of min cut/max flow for scale free graphs?
-
-
min cut/max flow are both well defined for scale free graphs...
-
intuition is that you will get a property that degrades gracefully as you prune graph from higher to lower res.
- Show replies
New conversation -
-
-
that is, scale freeness is a property of the degree distribution, while max flow/min cuts is well defined for a directed graph
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
you might have some intuitions you can expand, was the hope.
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.