A transitive closure algorithm
From MaRDI portal
Publication:5588122
DOI10.1007/BF01940892zbMath0193.14604OpenAlexW2070992781WikidataQ29041572 ScholiaQ29041572MaRDI QIDQ5588122
Publication date: 1970
Published in: BIT Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01940892
Related Items (22)
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ An efficient transitive closure algorithm for cyclic digraphs ⋮ A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities ⋮ Maximal and Maximum Transitive Relation Contained in a Given Binary Relation ⋮ The size of LALR (1) parsers ⋮ Applications of graph theory in computer systems ⋮ On the calculation of transitive reduction-closure of orders ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Partitioning, tearing and modification of sparse linear systems ⋮ On pure structure of dynamic 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 ⋮ TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS ⋮ A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph ⋮ Indexing Structure for Graph-Structured Data ⋮ 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 ⋮ An improved transitive closure algorithm ⋮ Computing transitive closure on systolic arrays of fixed size ⋮ Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Uses Software
Cites Work
This page was built for publication: A transitive closure algorithm
