A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs |
scientific article; zbMATH DE number 1883429
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs |
scientific article; zbMATH DE number 1883429 |
Statements
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (English)
0 references
17 March 2003
0 references
0.9163234
0 references
0.9021042
0 references
0.90171164
0 references
0.8841177
0 references
0 references
0 references
