%0 Conference Paper %1 conf/focs/KhullerS89 %A Khuller, Samir %A Schieber, Baruch %B FOCS %D 1989 %I IEEE Computer Society %K dblp %P 288-293 %T Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) %U http://dblp.uni-trier.de/db/conf/focs/focs89.html#KhullerS89 %@ 0-8186-1982-1

@inproceedings{conf/focs/KhullerS89, added-at = {2023-03-23T00:00:00.000+0100}, author = {Khuller, Samir and Schieber, Baruch}, biburl = {https://www.bibsonomy.org/bibtex/265ef0ca3f8a8ac46e711c9d5c1ddcb33/dblp}, booktitle = {FOCS}, crossref = {conf/focs/FOCS30}, ee = {https://doi.ieeecomputersociety.org/10.1109/SFCS.1989.63492}, interhash = {f6462ae5a4c8d7049f16a6fc46be8281}, intrahash = {65ef0ca3f8a8ac46e711c9d5c1ddcb33}, isbn = {0-8186-1982-1}, keywords = {dblp}, pages = {288-293}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T10:24:53.000+0200}, title = {Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary)}, url = {http://dblp.uni-trier.de/db/conf/focs/focs89.html#KhullerS89}, year = 1989 }