tags:

views:

18

answers:

1
Q: 

Algorithm for minimum diameter spanning tree

Given a undirected and connected graph G, find a spanning tree whose diameter is the minimum.

A: 

See if this helps. Haven't read it thoroughly myself though.

Gunner  2010-10-28 09:43:28

related questions

Is there an algorithm to find the best set of Pairs of vertices in a weighted graph without repetition?
Whats the best approach (Algorithim) to continually calculate cascading relationships between objects?
minimum connected subgraph containing a given set of nodes
How do I auto-layout boxes on a flowchart?
algorithm to pick set of winners using different weights
Algorithm for schematizing (metro) maps
How to find a cycle containing a set of nodes in a graph?
Cycle of maximum weight in a graph
How to choose an integer linear programming solver ?
Open Source Graph Layout Library
Reverse Breadth First traversal in C#
help with number calculation algorithm [hw]