An efficient transitive closure algorithm for cyclic digraphs

DOI10.1016/0020-0190(94)90128-7MaRDI QIDQ1341684zbMATH OpenOpenAlexFDO

Authors Esko Nuutila

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A sensitive transitive closure algorithm
• A transitive closure algorithm
• An improved transitive closure algorithm
• Depth-First Search and Linear Graph Algorithms
• On computing the transitive closure of a relation
• On finding the strongly connected components in a directed graph
• The transitive closure of a random digraph

This page was built for publication: An efficient transitive closure algorithm for cyclic digraphs

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