Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs (Q3771606)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs |
scientific article |
Statements
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs (English)
0 references
1987
0 references
efficient algorithms
0 references
design of VLSI circuits
0 references
minimum spanning forests
0 references
hierarchically defined graphs
0 references
