General Graph Identification By Hashing
Data Structures and Algorithms
2015-12-24 v1
Abstract
A method for identifying graphs using MD5 hashing is presented. This allows fast graph equality comparisons and can also be used to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled. The method identifies vertices by hashing the graph configuration in their neighborhoods. With each vertex hashed, the entire graph can be identified by hashing the vertex hashes.
Cite
@article{arxiv.1512.07263,
title = {General Graph Identification By Hashing},
author = {Tom Portegys},
journal= {arXiv preprint arXiv:1512.07263},
year = {2015}
}
Comments
First made public: February 2008 Code available at: https://sourceforge.net/projects/graph-hashing/