A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373)
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: A strongly polynomial algorithm for the inverse shortest arborescence problem |
scientific article; zbMATH DE number 1139437
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for the inverse shortest arborescence problem |
scientific article; zbMATH DE number 1139437 |
Statements
A strongly polynomial algorithm for the inverse shortest arborescence problem (English)
0 references
5 October 1998
0 references
inverse problem
0 references
weighted shortest arborescence problem
0 references
