# Talk:Widest path problem

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)

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)

This review is transcluded from Talk:Widest path problem/GA1. The edit link for this section can be used to add comments to the review.
Reviewer: I am accepting this article for review :-D. Please give me at least two weeks; I have been busy lately, and I tend to be pretty thorough ;-) ~Oshwah~(talk) (contribs)  14:42, 28 May 2016 (UTC)


### Criteria
### Review
Well-written:

Verifiable with no original research:

Broad in its coverage:

Neutral: it represents viewpoints fairly and without editorial bias, giving due weight to each.

Stable: it does not change significantly from day to day because of an ongoing edit war or content dispute.

Illustrated, if possible, by media such as images, video, or audio:


#### Result
#### Discussion
Please add any related discussion here.


### Additional notes