Maximum cycle-means of weighted digraphs (Q1920444): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical procedure for solving a minimization eigenvalue problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank |
Revision as of 14:07, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum cycle-means of weighted digraphs |
scientific article |
Statements
Maximum cycle-means of weighted digraphs (English)
0 references
20 October 1996
0 references
minimax algebra
0 references
LP algorithm
0 references
0 references
0 references