Permutation-Invariant Subgraph Discovery

1 code implementation • 2 Apr 2021 • Raghvendra Mall, Shameem A. Parambath, Han Yufei, Ting Yu, Sanjay Chawla

PSPI can be viewed as a robust formulation of the permutation inference or graph matching, where the objective is to find a permutation between two graphs under the assumption that a set of edges may have undergone a perturbation due to an underlying cause.

Graph Matching