New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Improved bhandari / suurbale algorithm #5

Open

afourmy opened this issue Aug 16, 2016 · 0 comments

Labels

Owner

afourmy commented Aug 16, 2016

Right now, I use bhandari / suurbale to find the shortest link-disjoint pair.
The following improvements can be implemented:

find the K edge-disjoint paths, K > 2.
instead of edge-disjoint paths, find the node-and-edge-disjoint paths (which ensures the recovery path is available in case of node failure too)
when no path is available, find the K maximally edge-disjoint paths (i.e the paths with the least number of edges in common)

afourmy added the enhancement label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment