On recursive computation of minimum spanning trees for special partial graphs (Q3690607)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3914113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On recursive computation of minimum spanning trees for special partial graphs |
scientific article; zbMATH DE number 3914113 |
Statements
On recursive computation of minimum spanning trees for special partial graphs (English)
0 references
1985
0 references
undirected graph
0 references
minimum spanning tree
0 references
symmetric traveling salesman
0 references
0 references
0 references
0.8942847
0 references
0.89426863
0 references
0.89226615
0 references
0.89050585
0 references
0.8904422
0 references
0 references
