Modifying the power method in max algebra (Q5946172): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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: Q4304869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A max version of the Perron-Frobenius theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power algorithm in max algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power method in max algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal similarity and equivalence for matrices over groups with 0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / 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: An efficient algorithm for critical circuits and finite eigenvectors in the max-plus algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Balancing Weighted Directed Graphs and Matrix Scaling / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:42, 3 June 2024

scientific article; zbMATH DE number 1658462
Language Label Description Also known as
English
Modifying the power method in max algebra
scientific article; zbMATH DE number 1658462

    Statements

    Modifying the power method in max algebra (English)
    0 references
    0 references
    14 October 2001
    0 references
    The authors consider the complexity of the power method to compute the maximum circuit geometric mean in max algebra systems. Also, the authors give a modified power method based on \textit{R. M. Karp's} formula [Discrete Math. 23, 309-311 (1978; Zbl 0386.05032)] and show that this new algorithm can compute the maximum circuit geometric mean in \(O(n^3)\) time.
    0 references
    0 references
    complexity
    0 references
    power method
    0 references
    maximum circuit geometric mean
    0 references
    max algebra systems
    0 references
    modified power method
    0 references
    algorithm
    0 references

    Identifiers