Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02579168 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982512167 / rank | |||
Normal rank | |||
Latest revision as of 10:00, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding minimum spanning trees in undirected and directed graphs |
scientific article |
Statements
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (English)
0 references
1986
0 references
The authors use the Fibonacci heap to obtain fast algorithms for finding minimum spanning trees in undirected and directed graphs. Both algorithms can be extended to allow a degree constraint at one vertex.
0 references
undirected graphs
0 references
F-heap
0 references
Fibonacci heap
0 references
algorithms
0 references
minimum spanning trees
0 references
