A sensitive transitive closure algorithm

DOI10.1016/0020-0190(81)90026-0MaRDI QIDQ1156488zbMATH OpenOpenAlexFDO

Authors Jürgen Ebert

Publication date 1981

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

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

zbMATH Keywords

depth-first closuredepth-first searchreachability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Theorem on Boolean Matrices
• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3711407 (Why is no real title available?)
• scientific article; zbMATH DE number 3340123 (Why is no real title available?)

Cited in

(5)

• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
• An efficient database transitive closure algorithm
• An efficient transitive closure algorithm for cyclic digraphs
• An improved transitive closure algorithm
• A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph

This page was built for publication: A sensitive transitive closure algorithm

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