A Heuristic Improvement of the Bellman-Ford Algorithm,

Abstract

We 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1993
Accession Number
ADA322742

Entities

People

  • Andrew N. Goldberg
  • Tomasz Radzik

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Classification
  • Computations
  • Computer Science
  • Computers
  • Mathematics
  • Military Research
  • Monitoring
  • Polynomials
  • Scientific Research
  • Security
  • Side Effects
  • Standards
  • Universities

Fields of Study

  • Computer science