Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs |
scientific article; zbMATH DE number 3983184
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding minimum spanning trees in undirected and directed graphs |
scientific article; zbMATH DE number 3983184 |
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
0.9231864
0 references
0.9218378
0 references
0.91691995
0 references
0.91670054
0 references
0.91638166
0 references
0.9155211
0 references
0.9120116
0 references
