A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:11, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for the inverse shortest arborescence problem |
scientific article |
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
