Efficient parallel algorithms for breadth first spanning forests of general graphs (Q3802640)
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 parallel algorithms for breadth first spanning forests of general graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient parallel algorithms for breadth first spanning forests of general graphs |
scientific article |
Statements
Efficient parallel algorithms for breadth first spanning forests of general graphs (English)
0 references
1986
0 references
parallel algorithm
0 references
breadth first search
0 references
breadth first spanning trees for graphs
0 references
