The State of the Art in Dynamic Graph Algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1617242
- Algorithmic aspects in speech recognition
- scientific article; zbMATH DE number 1956218
- scientific article; zbMATH DE number 871915
- Special issue: Dynamic graph algorithms
- On the computational complexity of dynamic graph problems
- Dynamic Algorithms for Graph Spanners
- Fast dynamic graph algorithms for parameterized problems
- Average-case analysis of dynamic graph algorithms
- Algorithms and hardness for diameter in dynamic graphs
Cited in
(8)- On the computational complexity of dynamic graph problems
- On certificates and lookahead in dynamic graph problems
- Dynamic graph stream algorithms in \(o(n)\) space
- Local mending
- Robust online algorithms for dynamic choosing problems
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
- Fast primal-dual update against local weight update in linear assignment problem and its application
- Temporally connected components
This page was built for publication: The State of the Art in Dynamic Graph Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5127173)