Login / Signup

The optimal general upper bound for the distinguishing index of infinite graphs.

Monika PilsniakMarcin Stawiski
Published in: J. Graph Theory (2020)
Keyphrases
  • upper bound
  • worst case
  • efficiently computable
  • lower bound
  • closely related
  • special case
  • neural network
  • optimal cost
  • database
  • data sets
  • graph theory
  • graph model