Pages that link to "Item:Q4372787"
From MaRDI portal
The following pages link to Sampling to provide or to bound: With applications to fully dynamic graph algorithms (Q4372787):
Displaying 8 items.
- Computing the map of geometric minimal cuts (Q476438) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (Q4575674) (← links)
- (Q4941837) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- A fully dynamic algorithm for maintaining the transitive closure (Q5917499) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)