An efficient transitive closure algorithm for cyclic digraphs
From MaRDI portal
Publication:1341684
DOI10.1016/0020-0190(94)90128-7zbMath0938.68754MaRDI QIDQ1341684
Publication date: 21 June 2000
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)90128-7
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- A sensitive transitive closure algorithm
- On computing the transitive closure of a relation
- On finding the strongly connected components in a directed graph
- An improved transitive closure algorithm
- The transitive closure of a random digraph
- A transitive closure algorithm
- Depth-First Search and Linear Graph Algorithms