scientific article; zbMATH DE number 3340124
From MaRDI portal
Publication:5616737
zbMath0214.23602MaRDI QIDQ5616737
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ Unnamed Item ⋮ An improved combinatorial algorithm for Boolean matrix multiplication ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ All-pairs bottleneck paths in vertex weighted graphs ⋮ Finding strong bridges and strong articulation points in linear time ⋮ All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time ⋮ Mantaining dynamic matrices for fully dynamic transitive closure ⋮ Limitations of incremental dynamic programming ⋮ On the calculation of transitive reduction-closure of orders ⋮ Algebraic methods in the congested clique ⋮ Computational experiences with some transitive closure algorithms ⋮ On computing the transitive closure of a relation ⋮ Unnamed Item ⋮ An improved transitive closure algorithm ⋮ Algorithms for generating convex sets in acyclic digraphs ⋮ Acyclic Digraphs ⋮ Unnamed Item ⋮ Elastic-Degenerate String Matching via Fast Matrix Multiplication
This page was built for publication:
