ALGEBRAIC TECHNIQUES OF PATH FINDING AND MINIMUM PATH FINDING IN GRAPHS

Abstract

An algebraic topological approach to finding all paths in a given graph under various conditions is presented. If a path with any particular characteristics is desired, such as: minimum dis tance, least cost, most reliable, etc., it can be extracted from the list of all paths. A direct method for finding a minimum path is also given. Both techniques are straight-forward and can easily be performed by a computer.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1963
Accession Number
AD0407791

Entities

People

  • D. Liss
  • R. Kolker
  • S. Okada

Organizations

  • MITRE Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Boundaries
  • Communication Networks
  • Continents
  • Contracts
  • Equations
  • Geographic Regions
  • Government Procurement
  • Governments
  • Massachusetts
  • Networks
  • New York
  • Numbers
  • Real Numbers
  • Systems Engineering
  • United States
  • Vector Spaces

Readers

  • Computational Modeling and Simulation
  • Mathematical Modeling and Probability Theory.
  • Military Training and Readiness Simulation