Matthias Grossglauser, Seyed Hamed Hassani, Ehsan Kazemi
In many graph–mining problems, two networks from different domains have to be matched. In the absence of reliable node attributes, graph matching has to rely on only the link structures of the two networks, which amounts to a generalization of the classic ...
Assoc Computing Machinery2015