General Graph Identification By Hashing

TL;DR

This paper introduces a hashing-based method for graph identification that enables rapid equality checks and aids in graph isomorphism testing, applicable to both labeled and unlabeled graphs.

Contribution

It proposes a novel approach using MD5 hashing of vertex neighborhoods for efficient graph identification and isomorphism testing.

Findings

Enables fast graph equality comparisons

Supports labeled and unlabeled graphs

Facilitates graph isomorphism testing

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.