An algorithm for finding the transitive closure of a digraph

DOI10.1007/BF02252839MaRDI QIDQ1225062zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3463685 (Why is no real title available?)
• An algorithm for finding the transitive closure of a digraph
• Depth-First Search and Linear Graph Algorithms

Cited in

(4)

• An improved transitive closure algorithm
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225062)