Given a undirected and connected graph G, find a spanning tree whose diameter is the minimum. How to solve this problem

  • 4
    $\begingroup$ Question? Motivation? $\endgroup$ – Anthony Labarre Oct 28 '10 at 8:37
  • 6
    $\begingroup$ Voting to close: see our FAQ and scholar.google.com/…" $\endgroup$ – Jukka Suomela Oct 28 '10 at 8:45
  • 2
    $\begingroup$ This a question $\endgroup$ – Rambo Oct 28 '10 at 9:35
  • 2
    $\begingroup$ Have you tried a search? Wasn't the results satisfactory? What you found up until now? These are the elements that make a question worth answering. $\endgroup$ – M.S. Dousti Oct 28 '10 at 11:48
  • 2
    $\begingroup$ @Joey Adams: According to our FAQ the OP should do their part by attempting to answer their questions by themselves before asking them here, and that includes Googling. See the meta discussion on how to ask a good question. @Rambo: Your question can be reopened if you improve it, e.g. tell us why you care, what you have done to find an answer, and what is the best thing you have found, and why that does not solve your problem. $\endgroup$ – Kaveh Oct 28 '10 at 17:34

Browse other questions tagged or ask your own question.