scientific article; zbMATH DE number 1202979

zbMATH Open0905.68007MaRDI QIDQ4209361

Stefan Dobrev, Peter Ružička

Publication date: 11 January 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

MST problemstrong time-optimal algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (3)

On the average communication complexity of asynchronous distributed algorithms ⋮ The Communication Complexity of Distributed epsilon-Approximations ⋮ New classes of distributed time complexity

This page was built for publication:

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