Abstract
We propose a new method for ordering the candidate nodes in label correcting methods for shortest path problems. The method tries to scan nodes with small labels as early as possible and may be viewed as a low‐overhead approximation to Dijkstra's algorithm. Compared with the D'Esopo–Pape algorithm, our method is equally simple but much faster. Our method can also be combined with the threshold algorithm, thereby considerably improving its practical performance. © 1993 by John Wiley & Sons, Inc.
Original language | English (US) |
---|---|
Pages (from-to) | 703-709 |
Number of pages | 7 |
Journal | Networks |
Volume | 23 |
Issue number | 8 |
DOIs | |
State | Published - Dec 1993 |
Externally published | Yes |
ASJC Scopus subject areas
- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications