On certificates and lookahead in dynamic graph problems

DOI10.1007/PL00009220zbMath0899.68050OpenAlexW2091186798MaRDI QIDQ1393083

Randall H. Wilson, Sanjeev Khanna

Publication date: 2 August 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009220

zbMATH Keywords

dynamic graph algorithmsgraph certificateslookahead algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (4)

Fast dynamic transitive closure with lookahead ⋮ Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ Mantaining dynamic matrices for fully dynamic transitive closure ⋮ A fully dynamic algorithm for maintaining the transitive closure

This page was built for publication: On certificates and lookahead in dynamic graph problems