A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (Q5133968): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Page on [mardi] deleted: Publication:5133968 |
EloiFerrer (talk | contribs) Merged Item from Q5368957 |
||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6789785 | |||||||||||||||
| Property / title | |||||||||||||||
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (English) | |||||||||||||||
| Property / title: A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1380.68421 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1145/3087801.3087823 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Proceedings of the ACM Symposium on Principles of Distributed Computing / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
11 October 2017
| |||||||||||||||
| Property / publication date: 11 October 2017 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 6789785 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
Bellman-Ford algorithm | |||||||||||||||
| Property / zbMATH Keywords: Bellman-Ford algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
distributed shortest paths | |||||||||||||||
| Property / zbMATH Keywords: distributed shortest paths / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W2592535728 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 10:22, 6 May 2024
scientific article; zbMATH DE number 6789785
- A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities |
scientific article; zbMATH DE number 6789785 |
|
Statements
A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities (English)
0 references
A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities (English)
0 references
11 November 2020
0 references
11 October 2017
0 references
distributed graph algorithms
0 references
minimum spanning tree
0 references
Bellman-Ford algorithm
0 references
distributed shortest paths
0 references
