Common-Neighbor-Count-Based Representative Possible World Finding on Uncertain Graphs
A two-stage basic algorithm that quickly initializes a possible world and then refines it iteratively, and it is proved that the problem seeks the possible world that best preserves the expected numbers of common neighbors between node pair, and it is proved that is NP-hard.