Login / Signup
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic.
Jesse Campion Loth
Kevin Halasz
Tomás Masarík
Bojan Mohar
Robert Sámal
Published in:
CoRR (2022)
Keyphrases
</>
neural network
graph theory
face recognition
computational complexity
small number
bipartite graph
random graphs
knn
upper bound
graph matching
graph structure
graph databases
graph representation
graph data
graph clustering
series parallel