Computational Complexity of Nachtigall's Representation

DOI10.1080/0233193031000090727zbMath1052.68057OpenAlexW2021302625MaRDI QIDQ4707438

Monika Molnárová

Publication date: 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193031000090727

zbMATH Keywords

max-plus algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Max algebraic powers of irreducible matrices in the periodic regime: an application of cyclic classes ⋮ Fiedler-Pták scaling in max algebra ⋮ Weak CSR expansions and transience bounds in max-plus algebra ⋮ Computing periodic request functions to speed-up the analysis of non-cyclic task models ⋮ Generalized matrix period in max-plus algebra ⋮ CSR expansions of matrix powers in max algebra

Cites Work

• Powers of matrices over an extremal algebra with applications to periodic graphs
• Matrix period in max-algebra
• Linear matrix period in max-plus algebra
• Unnamed Item

This page was built for publication: Computational Complexity of Nachtigall's Representation