Pages that link to "Item:Q3158547"
From MaRDI portal
The following pages link to Randomized fully dynamic graph algorithms with polylogarithmic time per operation (Q3158547):
Displayed 8 items.
- Dynamic shortest paths and transitive closure: algorithmic techniques and data structures (Q849628) (← links)
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete (Q938314) (← links)
- Maintaining dynamic minimum spanning trees: an experimental study (Q968158) (← links)
- Empire of colonies: Self-stabilizing and self-organizing distributed algorithm (Q1004316) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- Fully dynamic biconnectivity in graphs (Q1892579) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)