Faster parametric shortest path and minimum‐balance algorithms (Q5752305): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3105140593 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: cs/0205041 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of the minimum cycle mean in a digraph / rank | |||
Normal rank | |||
Latest revision as of 14:31, 21 June 2024
scientific article; zbMATH DE number 4187490
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster parametric shortest path and minimum‐balance algorithms |
scientific article; zbMATH DE number 4187490 |
Statements
Faster parametric shortest path and minimum‐balance algorithms (English)
0 references
1991
0 references
shortest paths
0 references
parametric shortest path problem
0 references
directed multigraph
0 references
minimum-mean-cost cycle problem
0 references
cycle-cancelling min-cost max-flow algorithms
0 references
min-balance problem
0 references
