Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks

DOI10.1145/3146550MaRDI QIDQ6829487zbMATH OpenFDO

Authors Monika R. Henzinger, Sebastian Krinninger, Danupon Nanongkai

Publication date 12 November 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

zbMATH Keywords

distributed algorithmsdynamic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

This page was built for publication: Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829487)