Computing the degree-4 shortest network under a given topology (Q1972318)
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 1436024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the degree-4 shortest network under a given topology |
scientific article; zbMATH DE number 1436024 |
Statements
Computing the degree-4 shortest network under a given topology (English)
0 references
7 June 2000
0 references
shortest network
0 references
Steiner topology
0 references
canonical tree
0 references
algorithm
0 references
0.8743043541908264
0 references
0.8733785152435303
0 references
