A sensitive transitive closure algorithm

DOI10.1016/0020-0190(81)90026-0zbMath0468.68066OpenAlexW2047783181MaRDI QIDQ1156488

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

reachabilitydepth-first searchdepth-first closure

Mathematics Subject Classification ID

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

Related Items (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 ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph ⋮ An improved transitive closure algorithm

Cites Work

• Depth-First Search and Linear Graph Algorithms
• A Theorem on Boolean Matrices
• Unnamed Item
• Unnamed Item

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