A Note on Finding All Shortest Paths

Abstract

The authors present a procedure for finding the shortest route between all pairs of nodes in a network. The approach is quite simple, but is highly efficient for a special class of network problems. In particular, this class of networks subsumes a number of networks which appear in real world application. For instance, the Polish government has developed a network model for water resource analysis which is in this class of networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1972
Accession Number
AD0749713

Entities

People

  • A. Napier
  • D. Klingman
  • Fred W. Glover

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Decomposition
  • Efficiency
  • Governments
  • Military Research
  • Transportation
  • United States
  • United States Government
  • Universities
  • Water
  • Water Resources

Fields of Study

  • Computer science

Readers

  • East Asian Political and Security Studies within the Soviet Union
  • Operations Research