Fast dynamic transitive closure with lookahead
From MaRDI portal
Publication:848959
DOI10.1007/S00453-008-9166-2zbMATH Open1191.68855OpenAlexW2090263269MaRDI QIDQ848959FDOQ848959
Authors: Piotr Sankowski, Marcin Mucha 
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9166-2
Recommendations
Cites Work
- Generalized Nested Dissection
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Matrix multiplication via arithmetic progressions
- An On-Line Edge-Deletion Problem
- Fast rectangular matrix multiplication and applications
- Rectangular matrix multiplication revisited
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- Title not available (Why is that?)
- Improved Dynamic Reachability Algorithms for Directed Graphs
- A fully dynamic algorithm for maintaining the transitive closure
- On certificates and lookahead in dynamic graph problems
- Faster dynamic matchings and vertex connectivity
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- 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)
