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

DOI10.1007/978-3-642-39212-2_53MaRDI QIDQ6829488zbMATH OpenFDO

Authors Monika R. Henzinger, Sebastian Krinninger, Danupon Nanongkai

Publication date 7 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

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

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