Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
From MaRDI portal
Publication:2355984
Recommendations
- Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Floyd-Warshall algorithm
- Cache-Friendly implementations of transitive closure
- scientific article; zbMATH DE number 1849117
- THE JANUS TEST: A HIERARCHICAL ALGORITHM FOR COMPUTING DIRECTION AND DISTANCE VECTORS (EXTENDED VERSION)*
- Shortest path and closure algorithms for banded matrices
Cites work
- A modular static analysis approach to affine loop invariants detection
- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
- Graph theory
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 17635 (Why is no real title available?)
- scientific article; zbMATH DE number 1772585 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- Iterating Octagons
- On computing the transitive closure of a relation
- On multiprocessor system scheduling
- Scheduling problems in a practical allocation model
- The algorithm design manual
This page was built for publication: Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355984)