A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Testing graph isomorphism
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
Two graphs G and H on n vertices are -far from being isomorphic if at least n 2 edges must be added or removed from E(G) in order to make G and H isomorphic. In this paper we deal with the question of how many queries are required to distinguish between the case that two graphs are isomorphic, and the case that they are -far from being isomorphic. A query is defined as probing the adjacency matrix of any one of the two graphs, i.e. asking if a pair of vertices forms an edge of the graph or not.doi:10.1145/1109557.1109591 fatcat:accwbpbj3ze5di2dvgctit44lu