Reachability and distances under multiple changes
From MaRDI portal
Recommendations
Cites work
- A strategy for dynamic programs: start over and muddle through
- Determinant: Old Algorithms, New Insights
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic Complexity under Definable Changes
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- Maintaining transitive closure in first order after node-set and edge-set deletions
- Nonrecursive incremental evaluation of Datalog queries
- On Deriving the Inverse of a Sum of Matrices
- On uniformity within \(NC^ 1\)
- Reachability is in DynFO
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- Uniform constant-depth threshold circuits for division and iterated multiplication.
Cited in
(10)- Dynamic complexity of expansion
- The dynamic descriptive complexity of k-clique
- The dynamic descriptive complexity of \(k\)-clique
- Dynamic complexity under definable changes
- Dynamic graph queries
- A strategy for dynamic programs: start over and muddle through
- Dynamic complexity of reachability: how many changes can we handle?
- Streaming graph algorithms in the massively parallel computation model
- Query maintenance under batch changes with small-depth circuits
- The parallel dynamic complexity of the abelian Cayley group membership problem
This page was built for publication: Reachability and distances under multiple changes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002805)
