A ''STRING ALGORITHM'' FOR SHORTEST PATHS IN DIRECTED NETWORKS

Abstract

A simple cutting procedure is described which can be combined with any algorithm for undirected networks (symmetric distance matrix) so as to form a shortest-path algorithm for directed networks (asymmetric distance matrix). In particular, the cutting and stretching can be alternated to form a ''string algorithm'' for directed networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1963
Accession Number
AD0427378

Entities

People

  • Victor Klee

Organizations

  • Boeing

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Analogs
  • Construction
  • Corporations
  • Government Procurement
  • Governments
  • Inventions
  • Literature
  • Mathematics
  • Procurement
  • Reasoning
  • Scientific Research
  • Specifications
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research