- Kim, E. Xing. 2012. The Algorithmic Details of Tractable MFC. Abstract: where the P (u, v) is the probability of an edge between u and v and δ((u, v)∈Bl) is an indicator whether the edge (u, v) is in the Bl or not. Hence, from eq.(1.2) and eq.(1.4), Algorithm 1: Infer the most probable T ∗ i from Bi Input: (1) Candidate set Bi (Bl = 〈kl, Cl, wl〉 where Cl is a subtree of Gi and wl is the value to its foreground). Output: (1) Candidate tree T ∗ i and (2) Pruned B∗ i (⊂ Bi). 1: Set A be an N×N zero matrix where N=|Si|. Set B∗ i←∅. foreach Bl = 〈kl, Cl, wl〉 ∈ Bi do foreach s ∈ Cl do foreach t ∈ Cl, t 6= s do A(s, t)← A(s, t) + wl end 2: Let T ∗ i be the maximum spanning tree of A. foreach Bl = 〈kl, Cl, wl〉 ∈ Bi do if all edges (u, v) ∈ Cl is in T ∗ i then B∗ i ← Bl. end
