Pages that link to "Item:Q848959"
From MaRDI portal
The following pages link to Fast dynamic transitive closure with lookahead (Q848959):
Displaying 7 items.
- Sharing the cost of maximum quality optimal spanning trees (Q1979176) (← links)
- Dynamic matrix rank with partial lookahead (Q2254496) (← links)
- Cache-Friendly implementations of transitive closure (Q3507763) (← links)
- (Q4471323) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- On certificates and lookahead in dynamic graph problems (Q4875189) (← links)
- A faster and simpler fully dynamic transitive closure (Q4962698) (← links)