a graph theory problem(maybe greedy)

Правка en4, от Tornad0, 2016-07-18 04:17:45

Hi, all

I have a problem wich may solved greedily.

Background: Here is a group G of a people, one maybe another's friend. How to select least number of people to be a leader of a subgroup, so that everyone in the group G has a friend as a leader?

Translate: find least number of radial-subgraph of a graph. By radial-subgraph, it means a subgraph which has at least one point which connects all the other point in the subgraph.

Thanks!

Теги greedy, graph

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский Tornad0 2016-07-18 04:17:45 352
en3 Английский Tornad0 2016-07-17 21:04:15 133
en2 Английский Tornad0 2016-07-17 20:50:10 14
en1 Английский Tornad0 2016-07-17 20:49:32 164 Initial revision (published)