Distributed Computation on Graphs: Shortest Path Algorithms.

Abstract

The authors use the paradigm of diffusing computation, introduced by Dijkstra and Scholten, to solve a class of graph problems. They present a detailed solution to the problem of computing shortest paths from a single vertex to all other vertices, in the presence of negative cycles. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1982
Accession Number
ADA120356

Entities

People

  • J. Misra
  • K. M. Chandy

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Computations
  • Computer Science
  • Computers
  • Graph Theory
  • Identities
  • Information Processing
  • Information Science
  • Mathematical Analysis
  • Numbers
  • Scientific Research
  • Security
  • Trees (Data Structures)
  • Universities

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Graph Algorithms and Convex Optimization.