Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values (Q2455841)
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: Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values |
scientific article; zbMATH DE number 5205329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values |
scientific article; zbMATH DE number 5205329 |
Statements
Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values (English)
0 references
26 October 2007
0 references
minimum spanning tree
0 references
shortest-path problem
0 references
inverse problem
0 references
reverse problem
0 references
computational complexity
0 references
0.8175633549690247
0 references
0.8148313164710999
0 references
0.8139734268188477
0 references
0.8132894039154053
0 references
0.813069760799408
0 references
