Pages that link to "Item:Q2941483"
From MaRDI portal
The following pages link to The Power of Dynamic Distance Oracles (Q2941483):
Displayed 14 items.
- The nearest colored node in a tree (Q1698706) (← links)
- Succinct data structures for nearest colored node in a tree (Q1705642) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- (Q5009578) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5925609) (← links)
- Approximate distance oracles with improved stretch for sparse graphs (Q5972260) (← links)
- (Q6062163) (← links)