On the \(K\) shortest path trees problem (Q1040982)
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 5639651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(K\) shortest path trees problem |
scientific article; zbMATH DE number 5639651 |
Statements
On the \(K\) shortest path trees problem (English)
0 references
27 November 2009
0 references
network/graphs
0 references
\(K\) shortest path trees problem
0 references
shortest path tree problem
0 references
\(K\) best spanning tree
0 references
\(K\) best solutions
0 references
0.91249114
0 references
0 references
0.9063982
0 references
0.90227085
0 references
0.9000571
0 references
0.8980162
0 references
0 references
0.8941441
0 references
