Using basis dependence distance vectors in the modified Floyd-Warshall algorithm
From MaRDI portal
Publication:2355984
DOI10.1007/s10878-014-9740-2zbMath1319.05123OpenAlexW2095148514WikidataQ59408642 ScholiaQ59408642MaRDI QIDQ2355984
Krzysztof Kraska, Tomasz Klimek, Włodzimierz Bielecki
Publication date: 28 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9740-2
transitive closureFloyd-Warshall algorithmparallelizing compilerarbitrarily nested loopbasis dependence vectors
Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the transitive closure of a relation
- Scheduling problems in a practical allocation model
- On multiprocessor system scheduling
- A Modular Static Analysis Approach to Affine Loop Invariants Detection
- Iterating Octagons
- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations