Tight bounds for distributed MST verification

DOI10.4230/LIPICS.STACS.2011.69MaRDI QIDQ6826422zbMATH OpenFDO

Authors Liah Kor, Amos Korman, David Peleg

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_7b9c.html

zbMATH Keywords

distributed algorithmsdistributed verificationlabeling schemesminimum-weight spanning tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: Tight bounds for distributed MST verification

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