An algorithm for scaling matrices and computing the minimum cycle mean in a digraph (Q1149744): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q791062
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Manfred von Golitschek / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3289358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of a function of several variables by the sum of functions of fewer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Scaling Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithm of diliberto and straus for approximating 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: Characterizations of optimal scalings of matrices / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083815366 / rank
 
Normal rank

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for scaling matrices and computing the minimum cycle mean in a digraph
scientific article

    Statements

    An algorithm for scaling matrices and computing the minimum cycle mean in a digraph (English)
    0 references
    1980
    0 references
    matrix scaling
    0 references
    preconditioning
    0 references
    digraphs
    0 references
    minimum cycle mean problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references