Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
From MaRDI portal
Publication:5901051
DOI10.1145/509907.509928zbMath1192.68469MaRDI QIDQ5901051
Sandeep Sen, Surender Baswana, Ramesh Hariharan
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W20: Randomized algorithms
Related Items
Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class, A dynamic topological sort algorithm for directed acyclic graphs