The following pages link to A transitive closure algorithm (Q5588122):
Displaying 23 items.
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- Partitioning, tearing and modification of sparse linear systems (Q1212513) (← links)
- On the vector representation of the reachability in planar directed graphs (Q1215513) (← links)
- Computational experiences with some transitive closure algorithms (Q1229720) (← links)
- On computing the transitive closure of a relation (Q1235010) (← links)
- An efficient transitive closure algorithm for cyclic digraphs (Q1341684) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- An improved transitive closure algorithm (Q1836309) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- Efficient determination of the transitive closure of a directed graph (Q2547483) (← links)
- Computing a graph's period quadratically by node condensation (Q2559390) (← links)
- On computing the time complexity of transitive closure algorithms (Q2561238) (← links)
- TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS (Q3056034) (← links)
- Maximal and Maximum Transitive Relation Contained in a Given Binary Relation (Q3196418) (← links)
- Indexing Structure for Graph-Structured Data (Q3627908) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- The size of LALR (1) parsers (Q4065011) (← links)
- Applications of graph theory in computer systems (Q4079059) (← links)
- On pure structure of dynamic systems (Q4130404) (← links)
- Finding strong components using depth-first search (Q6563999) (← links)
