The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices

DOI10.1080/02331939408843990zbMath0815.68080OpenAlexW1983281467MaRDI QIDQ4764873

Ján Plavka

Publication date: 30 June 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

matricesmaximum cycle mean

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

On Eigenproblem for Circulant Matrices in Max-Algebra ⋮ The weak robustness of interval matrices in max-plus algebra ⋮ The robustness of interval matrices in max-plus algebra ⋮ An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra. ⋮ \(\ell\)-parametric eigenproblem in max-algebra

This page was built for publication: The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices