In this report, we describe a novel graph invariant for computational graphs (colored directed acylic graphs) and how we used it to generate all distinct computational graphs up to isomorphism for small graphs. The algorithm iteratively applies isomorphism-invariant operations, which take into account the graph structure and coloring, and outputs a fixed-length hash that is identical for all isomorphic computational graphs. While the algorithm cannot perfectly distinguish all pairs of non-isomorphic computational graphs, we suggest that it may be useful as a heuristic for comparing graphs.
翻译:在本报告中,我们描述一个用于计算图表(彩色定向单体图形)和我们如何用它生成所有不同的计算图,直到小图的异形态。算法迭接地应用了异形态-异种操作,其中考虑到图形结构和颜色,并输出出一个对所有异形态计算图都相同的固定长度散列。虽然算法无法完全区分所有非单体计算图,但我们建议,它也许作为比较图表的超常法有用。