Computing the Transitive Closure of a Union of Affine Integer Tuple Relations

DOI10.1007/978-3-642-02026-1_9zbMath1246.05145OpenAlexW1581022180MaRDI QIDQ3637054

Włodzimierz Bielecki, Anna Beletska, Denis Barthou, Albert Cohen

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_9

zbMATH Keywords

transitive closureaffine tuple relations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Applying abstract acceleration to (co-)reachability analysis of reactive programs ⋮ Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach ⋮ Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm ⋮ Using basis dependence distance vectors in the modified Floyd-Warshall algorithm

This page was built for publication: Computing the Transitive Closure of a Union of Affine Integer Tuple Relations