Corpus ID: 62841773

Enumerating Unique Computational Graphs via an Iterative Graph Invariant

@article{Ying2019EnumeratingUC,
  title={Enumerating Unique Computational Graphs via an Iterative Graph Invariant},
  author={Chris Ying},
  journal={ArXiv},
  year={2019},
  volume={abs/1902.06192}
}
  • Chris Ying
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING

    Citations

    Publications citing this paper.

    NAS-Bench-101: Towards Reproducible Neural Architecture Search

    VIEW 1 EXCERPT
    CITES METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-5 OF 5 REFERENCES

    Canonical labelling of graphs in linear average time

    • L. Babai, L. Kucera
    • Mathematics, Computer Science
    • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
    • 1979
    VIEW 1 EXCERPT

    Graph Isomorphism in Quasipolynomial Time

    • L. Babai
    • Computer Science, Mathematics
    • ArXiv
    • 2015
    VIEW 1 EXCERPT

    The On-Line Encyclopedia of Integer Sequences

    • N. Sloane
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 1994
    VIEW 1 EXCERPT