Fast dynamic transitive closure with lookahead
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1306899 (Why is no real title available?)
- scientific article; zbMATH DE number 2079364 (Why is no real title available?)
- A fully dynamic algorithm for maintaining the transitive closure
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- An On-Line Edge-Deletion Problem
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast rectangular matrix multiplication and applications
- Faster dynamic matchings and vertex connectivity
- Generalized Nested Dissection
- Improved Dynamic Reachability Algorithms for Directed Graphs
- Matrix multiplication via arithmetic progressions
- On certificates and lookahead in dynamic graph problems
- Rectangular matrix multiplication revisited
- Triangular Factorization and Inversion by Fast Matrix Multiplication
Cited in
(7)- scientific article; zbMATH DE number 2079364 (Why is no real title available?)
- Fast matrix multiplication and its algebraic neighbourhood
- Dynamic matrix rank with partial lookahead
- Cache-Friendly implementations of transitive closure
- A faster and simpler fully dynamic transitive closure
- Sharing the cost of maximum quality optimal spanning trees
- Dynamic Plane Transitive Closure
This page was built for publication: Fast dynamic transitive closure with lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848959)
