On Computing the Transitive Closure of a Relation,

Abstract

An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon a variant of Tarjan's algorithm for finding the strongly connected components of a directed graph. This variant leads to a more compact statement of Tarjan's algorithm.

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1975
Accession Number
ADA022161

Entities

People

  • James Eve

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms

Readers

  • Mathematical Modeling and Probability Theory.
  • Military Science and Technology Research and Modernization.