An algorithm for finding the transitive closure of a digraph
From MaRDI portal
Publication:1225062
DOI10.1007/BF02252839zbMath0325.05103MaRDI QIDQ1225062
Publication date: 1975
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02252839
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
05-04: Software, source code, etc. for problems pertaining to combinatorics
Related Items
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