Login / Signup

On the hardness of finding the geodetic number of a subcubic graph.

Letícia Rodrigues BuenoLucia Draque PensoFábio ProttiVictor R. RamosDieter RautenbachUéverton S. Souza
Published in: Inf. Process. Lett. (2018)
Keyphrases
  • computational complexity
  • small number
  • information systems
  • maximum number
  • data mining
  • case study
  • structured data
  • bipartite graph
  • graph representation