Generating the maximum spanning trees of a weighted graph (Q3776656): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:47, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating the maximum spanning trees of a weighted graph |
scientific article |
Statements
Generating the maximum spanning trees of a weighted graph (English)
0 references
1987
0 references
efficient algorithm
0 references
maximum spanning trees
0 references
weighted graph
0 references
polynomial time algorithm
0 references
tree representations
0 references
acyclic hypergraph
0 references
