HIGHLIGHTS
SUMMARY
Common dissimilarities d considered in the literature include variants of graph edit distance (Ebsch 2020) and the graph matching distance (Chan and Cheney 2020; Sussman et_al 2019) (see "The graph matching distance" section for detail). There is an immense literature devoted to solving the related graph matching problem: Given graphs g, h ∈ Gn (with respective adjacency matrices A and B), find P ∈ n such that dGM (g, h)==AP - PB=F; see Conte et_al, Foggia et_al, EmmertStreib et_al, Yan et_al for a thorough review of the current graph matching literature. Multiplex networks Before lifting . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.