a graph theory problem(maybe greedy)

Revision en2, by Tornad0, 2016-07-17 20:50:10

Hi, all

How to find the least number of connected subgraphs of a graph? I think we can go greedy, but how to prove greedy works?

Thanks!

Tags greedy, graph

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English Tornad0 2016-07-18 04:17:45 352
en3 English Tornad0 2016-07-17 21:04:15 133
en2 English Tornad0 2016-07-17 20:50:10 14
en1 English Tornad0 2016-07-17 20:49:32 164 Initial revision (published)