Pages that link to "Item:Q5741790"
From MaRDI portal
The following pages link to Dynamic graph connectivity in polylogarithmic worst case time (Q5741790):
Displaying 31 items.
- An efficient strongly connected components algorithm in the fault tolerant model (Q666658) (← links)
- Optimal decremental connectivity in planar graphs (Q1693990) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Constant-time dynamic weight approximation for minimum spanning forest (Q2051831) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Labeled graph sketches: keeping up with real-time graph streams (Q2224937) (← 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)
- A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time (Q2810272) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Sample(x)=(a*x<=t) Is a Distinguisher with Probability 1/8 (Q4562282) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- (Q4614110) (← links)
- (Q5002703) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time (Q5020731) (← links)
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs (Q5075810) (← links)
- (Q5090930) (← links)
- (Q5092428) (← links)
- (Q5116480) (← links)
- Fully Dynamic Connectivity Oracles under General Vertex Updates (Q5136280) (← 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)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
- Near-optimal distributed computation of small vertex cuts (Q6579850) (← links)
- Move schedules: fast persistence computations in coarse dynamic settings (Q6589170) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
