Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure

zbMATH Open1249.68090MaRDI QIDQ2882988

A. Sh. Nepomnyaschaya

Publication date: 11 May 2012

Published in: Joint Bulletin of the Novosibirsk Computing Center (NCC) and A. P. Ershov Institute of Informatics Systems (IIS). Series: Computer Science (Search for Journal in Brave)

zbMATH Keywords

digraphspanning treespace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations

This page was built for publication: Associative version of Italiano's incremental algorithm for dynamic updating the transitive closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2882988)