This computer scientist is the second namesake of an algorithm that augments along a set of shortestaugmenting paths simultaneously to find a maximum matching in bipartite graphs.
This computer scientist is the second namesake of an algorithm that augments along a set of shortestaugmenting paths simultaneously to find a maximum matching in bipartite graphs. This computer scientistis also the second namesake of an algorithm that improves upon the Ford-Fulkerson algorithm by alwayschoosing the augmenting path with the smallest number of edges. This person wrote the paper ReducibilityAmong Combinatorial Problems, which introduced the standard methodology, based on the Cook-Levintheorem, for proving problems are NP-complete and categorized 21 problems as such. Thoseaforementioned algorithms are named with John Hopcroft and Jack Edmonds. This person is again thesecond namesake of an algorithm, widely used in multiple pattern searching, that calculates the hash of thepattern and all the substrings of a text of given length. For 10 points, identify this computer scientist whonames a string searching algorithm with Michael Rabin.
This computer scientist is the second namesake of an algorithm that augments along a set of shortestaugmenting paths simultaneously to find a maximum matching in bipartite graphs.
Richard Manning Karp