A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (Q4973061): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q4978020
 
aliases / en / 0aliases / en / 0
 
A time- and message-optimal distributed algorithm for minimum spanning trees
description / endescription / en
 
scientific article; zbMATH DE number 6761852
Property / title
 
A time- and message-optimal distributed algorithm for minimum spanning trees (English)
Property / title: A time- and message-optimal distributed algorithm for minimum spanning trees (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1370.68319 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3055399.3055449 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing / rank
 
Normal rank
Property / publication date
 
17 August 2017
Timestamp+2017-08-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 August 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6761852 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963420932 / rank
 
Normal rank

Latest revision as of 10:21, 6 May 2024

scientific article; zbMATH DE number 6761852
  • A time- and message-optimal distributed algorithm for minimum spanning trees
Language Label Description Also known as
English
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
scientific article; zbMATH DE number 6761852
  • A time- and message-optimal distributed algorithm for minimum spanning trees

Statements

A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees (English)
0 references
A time- and message-optimal distributed algorithm for minimum spanning trees (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
2 December 2019
0 references
17 August 2017
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
distributed algorithms
0 references
minimum spanning trees
0 references
0 references
0 references
0 references