The following pages link to (Q2934589):
Displaying 20 items.
- Dynamic matrix rank (Q843102) (← links)
- Fast dynamic transitive closure with lookahead (Q848959) (← links)
- Shortest augmenting paths for online matchings on trees (Q1743118) (← links)
- Dynamic matrix rank with partial lookahead (Q2254496) (← links)
- Deterministic dynamic matching in \(O(1)\) update time (Q2300734) (← links)
- Shortest Augmenting Paths for Online Matchings on Trees (Q2788991) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Reachability is in DynFO (Q3449473) (← links)
- Elastic Geometric Shape Matching for Point Sets under Translations (Q3449855) (← links)
- Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching (Q4571920) (← links)
- (Q4638113) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- (Q5002673) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) (← links)
- Dynamic Matching Algorithms in Practice (Q5874529) (← links)
- Approximating multistage matching problems (Q5918627) (← links)
- Approximating multistage matching problems (Q5918760) (← links)
- Deterministic dynamic matching in worst-case update time (Q6066769) (← links)
- Fast primal-dual update against local weight update in linear assignment problem and its application (Q6072219) (← links)
