The following pages link to (Q4230327):
Displayed 24 items.
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- A uniform approach to semi-dynamic problems on digraphs (Q1274321) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- Data structures for two-edge connectivity in planar graphs (Q1331953) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- Fully dynamic biconnectivity in graphs (Q1892579) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
- Average case analysis of fully dynamic reachability for directed graphs (Q3124401) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- Maintaining minimum spanning trees in dynamic graphs (Q4571989) (← links)
- Maintaining spanning trees of small diameter (Q4632429) (← links)
- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time (Q4645175) (← links)
- Approximating minimum cuts under insertions (Q4645185) (← links)
- Dynamic proximity calculations for situation awareness (Q4651716) (← links)
- Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
- Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
- On mixed connectivity certificates (Q6102287) (← links)
- Certificates and fast algorithms for biconnectivity in fully-dynamic graphs (Q6102299) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)
- Output-sensitive reporting of disjoint paths (extended abstract) (Q6142894) (← links)
- Average case analysis of fully dynamic connectivity for directed graphs (Q6184396) (← links)
- Fully dynamic maintenance of vertex cover (Q6184397) (← links)