Talk:Widest path problem

Widest path problem is currently a Computing and engineering good article nominee. Nominated by David Eppstein (talk) at 07:14, 28 April 2016 (UTC)

An editor has indicated a willingness to review the article in accordance with the good article criteria and will decide whether or not to list it as a good article. Comments are welcome from any editor who has not nominated or contributed significantly to this article. This review will be closed by the first reviewer. To add comments to this review, click discuss review and edit the page.

Mathematics B‑class Low‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
B	This article has been rated as B-class on Wikipedia's content assessment scale.
Low	This article has been rated as Low-priority on the project's priority scale.

A fact from Widest path problem appeared on Wikipedia's Main Page in the Did you know column on 3 May 2011 (check views). The text of the entry was as follows:

Did you know... that the widest path problem forms the algorithmic basis of the Schulze method used by Wikimedia to decide the winners of multiway elections?

A record of the entry may be seen at Wikipedia:Recent additions/2011/May.

Wikipedia

"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]

My guess prior to looking at the actual numbers was that "bottleneck shortest path" would be a more frequently used name than the one you propose. But Google scholar finds 1000 hits for "widest path", compared to 86 for "bottleneck shortest path" and 195 for "maximum capacity path", so (if the hit count can be believed) the current name is actually a good choice. I did add your alternative to the lede, though. —David Eppstein (talk) 17:13, 27 April 2011 (UTC)[reply]