Jump to content

Talk:Widest path problem

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 16:53, 27 April 2011 (r). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

"widest path" or "maximum capacity path"

As far as I know, the "width" of an arc is usually called its "capacity". I recommend that this article should be moved to "maximum capacity path problem". Markus Schulze 16:27, 27 April 2011 (UTC)[reply]

I think that, at least judging from the papers already cited in the article, "bottleneck shortest path" may be a more frequently used name. —David Eppstein (talk) 16:53, 27 April 2011 (UTC)[reply]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Widest_path_problem&oldid=426233784"