Login / Signup

Expected number of faces in a random embedding of any graph is at most linear.

Jesse Campion LothBojan Mohar
Published in: Comb. Probab. Comput. (2023)
Keyphrases
  • maximum number
  • small number
  • random walk
  • neural network
  • similarity measure
  • pairwise
  • knn
  • bipartite graph
  • graph theory
  • face identification
  • nodes of a graph