Login / Signup

Forcing generalised quasirandom graphs efficiently.

Andrzej GrzesikDaniel Král'Oleg Pikhurko
Published in: Comb. Probab. Comput. (2024)
Keyphrases
  • databases
  • graph matching
  • case study
  • graph model
  • graph kernels
  • neural network
  • similarity measure
  • highly efficient
  • spanning tree
  • series parallel