Graph isomorphism testing boosted by path coloring
Data Structures and Algorithms
2016-06-02 v1
Abstract
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 vertices into equivalence classes, which in turn reduces the combinatorial burden of isomorphism testing. Unrolling the graph into a tree at each vertex allows structurally different regular graphs to be discriminated, a capability that the color refinement algorithm cannot do.
Keywords
Cite
@article{arxiv.1606.00001,
title = {Graph isomorphism testing boosted by path coloring},
author = {Thomas E. Portegys},
journal= {arXiv preprint arXiv:1606.00001},
year = {2016}
}
Comments
arXiv admin note: text overlap with arXiv:1512.07263