The overall cost matrix, \(O\) , is the input to the Hungarian algorithm [1]}, [2]}, an \(O(|G|^3)\)  solution to the assignment problem. It is important to note that the Hungarian algorithm will align every node \(G\)  to some node in \(H\) . Optimally, we should only align nodes which we have sufficient confidence ought to be aligned, but this partial assignment problem is computationally harder (likely, NP hard), and beyond the scope of this work.
We show a graphical abstract of our algorithm in Figure .
