Generating the maximum spanning trees of a weighted graph (Q3776656): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(87)90053-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983186008 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:06, 19 March 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
