Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
From MaRDI portal
Publication:5901051
DOI10.1145/509907.509928zbMath1192.68469OpenAlexW2022086557MaRDI QIDQ5901051
Ramesh Hariharan, Sandeep Sen, Surender Baswana
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://eprints.iisc.ac.in/253/1/p117-baswana.pdf
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (2)
A dynamic topological sort algorithm for directed acyclic graphs ⋮ Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
This page was built for publication: Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
