Pages that link to "Item:Q1183336"
From MaRDI portal
The following pages link to An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix (Q1183336):
Displaying 14 items.
- On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns (Q1124653) (← links)
- Strong regularity of matrices -- a survey of results (Q1314327) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra. (Q1811083) (← links)
- Extremal eigenproblem for bivalent matrices (Q1894469) (← links)
- Maximum cycle-means of weighted digraphs (Q1920444) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- \(\ell\)-parametric eigenproblem in max-algebra (Q2565847) (← links)
- Eigenproblem for optimal-node matrices in max-plus algebra (Q2926008) (← links)
- Computation of the Second Maximum Path Weight in a Max-Plus Matrix (Q3113274) (← links)
- (Q3732610) (← links)
- On Eigenproblem for Circulant Matrices in Max-Algebra (Q4531546) (← links)
- Eigenproblem for monotone and toeplitz matrices in a Max-algebra (Q4656061) (← links)
- The complexity of finding the minimal of the maximum cycle means of similar zero-one matrices (Q4764873) (← links)
