3 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2016
Graph isomorphism testing boosted by path coloring
Thomas E. Portegys
A method for improving the efficiency of graph isomorphism testing is presented. The method uses the structure of the graph colored by vertex hash codes as a means of partitioning…
cs.DS2015★ 1 cited
General Graph Identification By Hashing
Tom Portegys
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…