The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices
From MaRDI portal
Publication:4764873
DOI10.1080/02331939408843990zbMath0815.68080MaRDI QIDQ4764873
Publication date: 30 June 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939408843990
90C60: Abstract computational complexity for mathematical programming problems
68R10: Graph theory (including graph drawing) in computer science
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
On Eigenproblem for Circulant Matrices in Max-Algebra, The weak robustness of interval matrices in max-plus algebra, An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra., The robustness of interval matrices in max-plus algebra, \(\ell\)-parametric eigenproblem in max-algebra