An algorithm of the minimal cost spanning tree about communication network (Q3537381)
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 5370966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm of the minimal cost spanning tree about communication network |
scientific article; zbMATH DE number 5370966 |
Statements
24 November 2008
0 references
communication network
0 references
most short-path spanning tree
0 references
``Checkerboard'' distance
0 references
imaginary station
0 references
minimal cost spanning tree
0 references
0.8168011903762817
0 references
0.7888656854629517
0 references
0.7781263589859009
0 references
