Dynamic graph algorithms with applications
From MaRDI portal
Recommendations
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Maintaining minimum spanning trees in dynamic graphs
- scientific article; zbMATH DE number 1775391
- scientific article; zbMATH DE number 1263228
- Maintaining minimum spanning forests in dynamic graphs
Cited in
(20)- Dynamic graphs
- On the computational complexity of dynamic graph problems
- Dynamic graph models
- A theory and algorithms for combinatorial reoptimization
- Dynamic graph stream algorithms in \(o(n)\) space
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- Dynamic graph models and their properties
- Dynamic Graphs in the Sliding-Window Model
- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
- Analysis and experimental study of heuristics for job scheduling reoptimization problems
- The State of the Art in Dynamic Graph Algorithms
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
- Dynamic algorithms for graphs with treewidth 2
- Stable and dynamic minimum cuts
- Minimum cut in \(O(m \log^2 n)\) time
- Minimum cut in O(m^2 n time
- Efficient maximum Euclidean distance transform computation in component trees using the differential image foresting transform
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Stable and dynamic minimum cuts
- Recent advances in fully dynamic graph algorithms (invited talk)
This page was built for publication: Dynamic graph algorithms with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721962)
