Let G = (N A) be a directed graph with node set N and arc set A where the cardinality of N and A are denoted by jNjand jAj, respectively.

An example is presented to show that the worst-case complexity of Bertsekas' small-label-first strategy for the shortest path problem is exponential.

An example is presented to show that the worst case complexity of Bertsekas small label rst strategy for the shortest path problem is exponential.

An example is presented to show that the worst-case complexity of Bertsekas' small-label-first strategy for the shortest path problem is exponential.

Zhi-Long Chen, Warren B. Powell: A note on Bertsekas' small-label-first strategy. Networks 29(2): 111-116 (1997). manage site settings.

Counting small cycles in generalized de Bruijn digraphs. 39-47. view ... A note on Bertsekas' small-label-first strategy. 111-116. view. electronic ...

Chen and W.B. Powell. A note on bertsekas's small-label-first strategy. Networks, 29:111–116, 1997. Article MATH MathSciNet Google Scholar.

Zhi-Long Chen, Warren B. Powell: A note on Bertsekas' small-label-first strategy. 111-116. Electronic Edition (link) BibTeX · Hosam M. F. AboElFotoh ...

Abstract. In this paper we develop parallel asynchronous implementations of some known and some new label correcting methods for finding a shortest path ...

... 81. Chen, Z.-L., and Powell, W. B.: A Note on Bertsekas' Small-LabelFirst Strategy, 111. Chhajed, D.: Edge Coloring a K-Tree into Two Smaller Trees, 191.