Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint (Q1286282)
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: Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint |
scientific article |
Statements
Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint (English)
0 references
3 May 1999
0 references
fine-grained parallel SIMD systems
0 references
0 references
0 references
