Search Results for author:
Found 1 papers, 1 papers with code
Expectation-Complete Graph Representations with Homomorphisms
We investigate novel random graph embeddings that can be computed in expected polynomial time and that are able to distinguish all non-isomorphic graphs in expectation.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
