Pages that link to "Item:Q5441357"
From MaRDI portal
The following pages link to Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (Q5441357):
Displaying 41 items.
- A game theoretic approach to the analysis of dynamic networks (Q2864354) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On Dynamic DFS Tree in Directed Graphs (Q2946380) (← links)
- Time Windowed Data Structures for Graphs (Q3121517) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Faster Fully-Dynamic Minimum Spanning Forest (Q3452837) (← links)
- MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (Q3454125) (← links)
- Fully Dynamic Algorithms for 2-Edge Connectivity (Q4027863) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- (Q5009521) (← 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)
- (Q5077149) (← links)
- Least resolved trees for two-colored best match graphs (Q5084685) (← links)
- (Q5090485) (← links)
- (Q5091082) (← links)
- (Q5091209) (← links)
- (Q5092428) (← links)
- (Q5116480) (← links)
- (Q5116484) (← 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)
- (Q5743413) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Fast and Deterministic Approximations for k-Cut. (Q5875475) (← links)
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
- Dynamic graph coloring (Q5915986) (← links)
- Fully dynamic arboricity maintenance (Q5918831) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay (Q6124426) (← links)
- Dynamic connectivity in disk graphs (Q6145677) (← links)
- Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics (Q6180362) (← links)
- Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time (Q6566592) (← links)
- Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity (Q6614619) (← links)
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions (Q6646016) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)
