| Article ID: | iaor2002408 |
| Country: | United States |
| Volume: | 29 |
| Issue: | 2 |
| Start Page Number: | 111 |
| End Page Number: | 116 |
| Publication Date: | Mar 1997 |
| Journal: | Networks |
| Authors: | Powell Warren B., Chen Zhi-Long |
An example is presented to show that the worst-case complexity of Bertsekas' small-label-first strategy for the shortest path problem is exponential. It becomes polynomial if, when scanning a node