How can we find the virtual twin (ie, the same or similar user) on Linked In for a user on
Facebook? How can we effectively link an information network with a social network to …

Graph matching is a fundamental problem in computer vision. In this paper, we propose a
novel graph matching algorithm based on tabu search. The proposed method solves graph …

The problem of graph matching in general is NP-hard and approaches have been proposed
for its suboptimal solution, most focusing on finding the one-to-one node mapping between …

Large graph datasets are common in many emerging database applications, and most
notably in large-scale scientific applications. To fully exploit the wealth of information …

Approximate graph matching (AGM) refers to the problem of mapping the vertices of two
structurally similar graphs, which has applications in social networks, computer vision …

Graph matching plays an essential role in many real applications. In this paper, we study
how to match two large graphs by maximizing the number of matched edges, which is …

Given two graphs, the graph matching problem is to align the two vertex sets so as to
minimize the number of adjacency disagreements between the two graphs. The seeded …

People nowadays usually participate in multiple online social networks simultaneously to
enjoy more social network services. Besides the common users, social networks providing …

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 …

Graph matching is widely used in a variety of scientific fields, including computer vision, due
to its powerful performance, robustness, and generality. Its computational complexity …