THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings / rank | |||
Normal rank | |||
Revision as of 12:46, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS |
scientific article |
Statements
THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (English)
0 references
22 June 2005
0 references
distributed algorithms
0 references
spanning trees
0 references
minimum degree spanning trees
0 references
asynchronous algorithms
0 references
