4 citations · 4 across the 4 of their papers we have counts for
1 paper · 1 filter
Pascal Welke, Maximilian Thiessen, Fabian Jogl +1
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. Previous gr…