In this paper, we propose an algorithm to find the optimal isomorphism between two random graphs. The problem is formulated as a state-space search problem. The branch-and-bound algorithm using an efficient evaluation function is used to speed up the search. For this algorithm, we derive a consistent lower bounded estimate for an evaluation function from the entropy characteristics.