THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054104002571 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1540674943 / rank | |||
Normal rank | |||
Latest revision as of 11:15, 30 July 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
