A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On an instance of the inverse shortest paths problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5567717 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum branchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4739657 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An inverse problem of the weighted shortest path problem / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1570195365 / rank | |||
Normal rank | |||
Latest revision as of 08:32, 30 July 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
