A transitive closure algorithm

DOI10.1007/BF01940892MaRDI QIDQ5588122zbMATH OpenOpenAlexWikidataFDO

Authors P. Jun. Purdom

Publication date 1970

Published in BIT Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01940892

zbMATH Keywords

computer science and automata

Cites work

• A Theorem on Boolean Matrices
• An algorithm for computing all paths in a graph
• Topological sorting of large networks

Cited in

(27)

• An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
• Partitioning, tearing and modification of sparse linear systems
• On the vector representation of the reachability in planar directed graphs
• Computational experiences with some transitive closure algorithms
• On computing the transitive closure of a relation
• An efficient transitive closure algorithm for cyclic digraphs
• Conflict-driven answer set solving: from theory to practice
• An improved transitive closure algorithm
• A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph
• Efficient determination of the transitive closure of a directed graph
• Computing a graph's period quadratically by node condensation
• On computing the time complexity of transitive closure algorithms
• Two algorithms for fast incremental transitive closure of sparse fuzzy binary relations
• Maximal and maximum transitive relation contained in a given binary relation
• Indexing Structure for Graph-Structured Data
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• Edmonds-Karp
• Flow Networks
• Gabow SCC
• The size of LALR (1) parsers
• Applications of graph theory in computer systems
• On pure structure of dynamic systems
• Prpu_Maxflow
• Finding strong components using depth-first search
• On the calculation of transitive reduction-closure of orders
• Computing transitive closure on systolic arrays of fixed size
• Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

Describes a project that uses

Uses Software

• Euler

This page was built for publication: A transitive closure algorithm

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