An algorithm for finding the transitive closure of a digraph

DOI10.1007/BF02252839zbMath0325.05103OpenAlexW423069184MaRDI QIDQ1225062

J. Dzikiewicz

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02252839

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ An algorithm for finding the transitive closure of a digraph ⋮ Computational experiences with some transitive closure algorithms ⋮ An improved transitive closure algorithm

Cites Work

• An algorithm for finding the transitive closure of a digraph
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item

This page was built for publication: An algorithm for finding the transitive closure of a digraph