Publications
Export 1 results:
Author Title Type [ Year] Filters: Keyword is paths;graphs;k-edge [Clear All Filters]
1989. Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs. Foundations of Computer Science, 1989., 30th Annual Symposium on. :288-293.