Parallel Flow Graph Matching for Automated Program Recognition (opens in new tab)

Parallel Flow Graph Matching for Automated Program Recognition Ritto, Patrick M. A flow graph matching algorithm has been implemented on the Connection Machine which employs parallel techniques to allow efficient subgraph matching. By constructing many different matchings in parallel, the algorithm is able to perform subgraph matching in polynomial time in the size of the graphs. The automated program recognition system can use this algorithm to help make a more efficient flow graph parser. T...