Is there a recursive-cuts generalization of min cut/max flow for scale free graphs?
Conversation
Show replies
Replying to
I think there is a bunch of work on multi-resolution spectral graphs. I think search for cascaded Laplacians.
1
Replying to
tangentially, the soviet rail network looks pretty scale free, homepages.cwi.nl/~lex/files/his original motivation
1


