Ignore this box please.
More
Settings
Goodies
About
Help
Feedback
PRIVACY
DontTrack
DontBubble
Policy
COMMUNITY
Platform
Forum
Chat
Spread
Search syntax
s:d sort by date
r:uk uk region
site: domain search
\ search first result
More...
r:n turn off region
!a search search amazon
site:uk uk pages
f: find files
t: within title
b: within body
More explanation...
Widest path problem
In graph algorithms, the widest path problem, also known as the bottleneck shortest path problem or the maximum capacity path problem, is the problem of finding a path between two designated vertices in a weighted directed graph, maximizing the weight of the minimum-weight edge in the path.
More at Wikipedia
Polynomial-time problems
Network theory
More related topics
Computational problems in graph theory
Graph algorithms
This page requires Javascript.Get the non-JS version
here
.