5

this is probably a stupid question, but what is the canonical problem that asks for the minimum set of vertices out of a graph, so that from these vertices, all other vertices can be reached by "traveling" no more than one edge? The real-life application would be: Which people do I need to know, to be connected to everybody else on the planet by just one degree? Thanks!

user1769925
  • 588
  • 1
  • 6
  • 15

1 Answers1

3

I think it's the Dominating Set Problem, closely related to the normal set cover problem

Origin
  • 2,009
  • 5
  • 19
  • 19