When two social groups merge, members of both groups should socialize effectively into the merged new entity. In other words, interpersonal ties should be established between the groups to give members appropriate access to resource and information. Viewing a social group as a network, we investigate such integration from a computational perspective. In particular, we assume that the networks have equipotent nodes, which refers to the situation when every member has equal privilege. We introduce the network integration problem: Given two networks, set up links between them so that the integrated network has diameter no more than a fixed value. We propose a few heuristics for solving this problem, study their computational complexity and compare their performance using experimental analysis. The results show that our approach is a feasible way to solve the network integration problem by establishing a small number of edges.