This document proposes an algorithm to merge business processes from different organizations to facilitate collaboration. The algorithm begins by preprocessing the business processes into directed graph formats. It then identifies the maximum common regions between the graphs and computes added nodes and edges. A transitive reduction is applied to extract the minimum number of edges that maintains reachability. The merged graph is then converted back into a business process model and validated. The algorithm aims to increase compatibility between organizational processes to reduce collaboration costs and effort.