Fully dynamic exact edge connectivity in sublinear time
From MaRDI portal
Publication:6538528
Cited in
(6)- Stable and dynamic minimum cuts
- On the streaming complexity of expander decomposition
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Efficient contractions of dynamic graphs -- with applications
- Stable and dynamic minimum cuts
- Maximum-flow and minimum-cut sensitivity oracles for directed graphs
This page was built for publication: Fully dynamic exact edge connectivity in sublinear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538528)