Login / Signup

) algorithm for computing the strong geodetic number in outerplanar graphs.

Mauro Mezzini
Published in: Discuss. Math. Graph Theory (2022)
Keyphrases
  • graph isomorphism
  • computational complexity
  • undirected graph
  • k means
  • np hard
  • tree structure
  • probabilistic model
  • structured data
  • matching algorithm
  • graph mining
  • graph databases
  • subgraph mining