Several algorithms for sparsest cut (and other kinds of balanced cuts) in planar graphs have been published, like for instance:

But I fail to find any implementation, including in graph cut libraries like KaHiP.

Does anyone have such an implementation, or explanations of why there is none?

  • 2
    $\begingroup$ Implementing stuff does not get one tenure. $\endgroup$ May 26 at 10:47


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.