Listing all the minimum spanning trees in an undirected graph (Q3066964): 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.1080/00207160903329699 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058363692 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Listing all the minimum spanning trees in an undirected graph |
scientific article |
Statements
Listing all the minimum spanning trees in an undirected graph (English)
0 references
20 January 2011
0 references
minimum spanning tree
0 references
enumeration algorithm
0 references
