Skip to content

Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)

Samir Khuller, Baruch Schieber

VenueA*FOCS
Year1989
ProceedingsFOCS

Browse the full FOCS paper archive.