Artigo
Acesso aberto
Revisado por pares
A heuristic improvement of the Bellman-Ford algorithm
1993; Elsevier BV; Volume: 6; Issue: 3 Linguagem: Inglês
10.1016/0893-9659(93)90022-f
ISSN1873-5452
AutoresAndrew V. Goldberg, Tomasz Radzik,
Tópico(s)Advanced Graph Theory Research
ResumoWe describe a new shortest paths algorithm. Our algorithm achieves the same O(nm) worst-case time bound as Bellman-Ford algorithm but is superior in practice.
Referência(s)