We define the degree of alignment between G p and G qa as the maximum sum of the degrees of match between aligned events in G p and G qa , which is formulated as a variant of the maximum weighted bipartite matching problem, which in turn is a special case of a 0-1 linear program.
let V p and V qa be the events in G p and G qa , respectively.