Pages that link to "Item:Q4764873"

The following pages link to The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices (Q4764873):

Displaying 8 items.

• The weak robustness of interval matrices in max-plus algebra (Q400506) (← links)
• On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns (Q1124653) (← links)
• An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix (Q1183336) (← links)
• An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra. (Q1811083) (← links)
• The robustness of interval matrices in max-plus algebra (Q2442283) (← links)
• Permuted max-algebraic eigenvector problem is \(NP\)-complete (Q2479500) (← links)
• \(\ell\)-parametric eigenproblem in max-algebra (Q2565847) (← links)
• On Eigenproblem for Circulant Matrices in Max-Algebra (Q4531546) (← links)