On computing the time complexity of transitive closure algorithms

DOI10.1016/0020-0190(73)90010-0zbMath0263.05110OpenAlexW1974217322MaRDI QIDQ2561238

Joel Coffy

Publication date: 1973

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(73)90010-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

On computing the time complexity of transitive closure algorithms ⋮ An improved transitive closure algorithm

Cites Work

• Parallel concepts in graph theory
• On computing the time complexity of transitive closure algorithms
• A transitive closure algorithm
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: On computing the time complexity of transitive closure algorithms