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

CC BY-SA 2.5
2010-10-28T08:37:19.373Z
Question? Motivation?
Anthony Labarre
CC BY-SA 2.5
2010-10-28T08:45:02.890Z
Voting to close: see our FAQ and http://scholar.google.com/scholar?q="minimum+diameter+spanning+tree"
Jukka Suomela
CC BY-SA 2.5
2010-10-28T09:35:41.703Z
This a question
Rambo
CC BY-SA 2.5
2010-10-28T11:48:11.300Z
Have you tried [a search](http://www.google.com/search?q=Minimum+Diameter+Spanning+Tree)? Wasn't the results satisfactory? What you found up until now? These are the elements that make a question worth answering.
Sadeq Dousti
CC BY-SA 2.5
2010-10-28T15:07:16.523Z
@Sadeq Dousti: The link you should be suggesting is [here](http://stackexchange.com/search?q=minimum+diameter+spanning+tree).  If satisfactory answers aren't on StackExchange (even if they're easy to find on Google), then a question is fair to ask.  Currently, the top result is this one (closed as off-topic), and the second-to-top result just links to Google Docs.  Read/listen to [StackOverflow Podcast #58](http://itc.conversationsnetwork.org/shows/detail4148.html) for Joel Spolsky's take on the issue.
Joey Adams
CC BY-SA 2.5
2010-10-28T17:34:42.530Z
@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.
Kaveh
CC BY-SA 2.5
2010-10-28T21:51:16.780Z
I agree to Kaveh.  [Here is a link to the Meta discussion on how to ask a good question](http://meta.cstheory.stackexchange.com/questions/300/how-to-ask-a-good-question).
Tsuyoshi Ito
<tag-removed>
Algorithm for Minimum Diameter Spanning Tree
Rambo
# Algorithm for Minimum Diameter Spanning Tree

(Asked by: username_0 on 2010-10-28)

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

**Tags:** tag-removed
> **Comments:**
> **username_1**: Question? Motivation?  
> **username_2**: Voting to close: see our FAQ and http://scholar.google.com/scholar?q="minimum+diameter+spanning+tree"  
> **username_0**: This a question  
> **username_3**: Have you tried [a search](http://www.google.com/search?q=Minimum+Diameter+Spanning+Tree)? Wasn't the results satisfactory? What you found up until now? These are the elements that make a question worth answering.  
> **username_4**: @Sadeq Dousti: The link you should be suggesting is [here](http://stackexchange.com/search?q=minimum+diameter+spanning+tree).  If satisfactory answers aren't on StackExchange (even if they're easy to find on Google), then a question is fair to ask.  Currently, the top result is this one (closed as off-topic), and the second-to-top result just links to Google Docs.  Read/listen to [StackOverflow Podcast #58](http://itc.conversationsnetwork.org/shows/detail4148.html) for Joel Spolsky's take on the issue.  
> **username_5**: @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.  
> **username_6**: I agree to Kaveh.  [Here is a link to the Meta discussion on how to ask a good question](http://meta.cstheory.stackexchange.com/questions/300/how-to-ask-a-good-question).  

---

## 0 answers

