You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.