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):
Displaying 34 items.
- The saga of minimum spanning trees (Q458468) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Upper and lower bounds for fully retroactive graph problems (Q832892) (← links)
- 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)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Discovering recurring activity in temporal networks (Q1741356) (← links)
- Fully dynamic biconnectivity in graphs (Q1892579) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Fully dynamic all pairs shortest paths with real edge weights (Q2496318) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- Randomization for Efficient Dynamic Graph Algorithms (Q2795930) (← links)
- Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks (Q2864176) (← links)
- A Planar linear arboricity conjecture (Q2891050) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Time Windowed Data Structures for Graphs (Q3121517) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- (Q5092428) (← links)
- (Q5116480) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- A consistent semantics of self-adjusting computation (Q5398334) (← links)
- (Q5874462) (← links)
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon (Q6057802) (← links)
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay (Q6124426) (← links)
- Incremental dead state detection in logarithmic time (Q6535537) (← 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)
