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:
SODA (2024)
Keyphrases
</>
random graphs
graph matching
small number
directed graph
maximum number
graph partitioning
pairwise
bipartite graph
similarity measure
randomly distributed
graph theoretic
polynomial time complexity
subgraph isomorphism
spanning tree
graph databases
graph mining
graph structure