Tight bounds on the message complexity of distributed tree verification

DOI10.1007/S00446-025-00483-XMaRDI QIDQ6954066zbMATH OpenFDO

Authors Shay Kutten, Peter Robinson, Ming Ming Tan

Publication date 24 July 2025

Published in Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

lower boundmessage complexitydistributed minimum spanning treedistributed graph verification

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)

This page was built for publication: Tight bounds on the message complexity of distributed tree verification

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