scientific article; zbMATH DE number 3340124
From MaRDI portal
Publication:5616737
Cited in
(18)- Algorithms for generating convex sets in acyclic digraphs
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
- Computational experiences with some transitive closure algorithms
- On computing the transitive closure of a relation
- An improved transitive closure algorithm
- Acyclic digraphs
- Lower bounds for combinatorial algorithms for Boolean matrix multiplication
- Finding strong bridges and strong articulation points in linear time
- Even faster elastic-degenerate string matching via fast matrix multiplication
- Limitations of incremental dynamic programming
- Improved output-sensitive quantum algorithms for Boolean matrix multiplication
- Elastic-Degenerate String Matching via Fast Matrix Multiplication
- All-pairs bottleneck paths in vertex weighted graphs
- Evaluating regular path queries on compressed adjacency matrices
- On the calculation of transitive reduction-closure of orders
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
- All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time
- Mantaining dynamic matrices for fully dynamic transitive closure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5616737)
