Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

bottleneck length is the maximum weight of any edge in a path bottleneck distance is the minimum bottleneck length of any path between two vertices.

Consider an undirected weighted graph G, describe and analyze an algorithm to compute the bottleneck distance between every pair of vertices in G.

share|improve this question
I would probably try an adapted version of Warshall's algorithm. – EuYu Dec 17 '12 at 4:11
4  
If this is homework, please mark it as such, and explain what you have done so far and what you are having trouble with. – Jonathan Christensen Dec 17 '12 at 4:20

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.