Dynamic complexity of reachability: how many changes can we handle?

DOI10.4230/LIPICS.ICALP.2020.122MaRDI QIDQ6842448zbMATH OpenFDO

Authors Samir Datta, Pankaj Kumar, A. Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

reachabilitydynamic complexitycomplex changes

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Dynamic complexity of reachability: how many changes can we handle?

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