THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:36, 3 February 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
