Given a list of k source-sink pairs in a graph, this algorithm finds almost k mutually avoiding paths with high probability using randomisation. The problem of finding exactly k is NP-complete.
-
Notifications
You must be signed in to change notification settings - Fork 0
adibaejaz/mapp
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A polynomial time approximation algorithm for the mutually avoiding paths problem.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published