Maximum cycle-means of weighted digraphs
From MaRDI portal
Recommendations
Cites work
- A characterization of the minimum cycle mean in a digraph
- An O(n^ 2) algorithm for the maximum cycle mean of an n n bivalent matrix
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- Numerical procedure for solving a minimization eigenvalue problem
- Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones
Cited in
(12)- The cost-to-time ratio problem for large or infinite graphs
- An optimal algorithm for the period of a strongly connected digraph
- Algorithms for finding the minimum cycle mean in the weighted directed graph
- Strong regularity of matrices -- a survey of results
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- Effective search for all maximal mean cycles in a graph
- Lower bounds for Howard's algorithm for finding minimum mean-cost cycles
- scientific article; zbMATH DE number 3841916 (Why is no real title available?)
- A numerical approach to long cycles in graphs and digraphs
- A simplex-like method to compute the eigenvalue of an irreducible (,+)-system
- Games on deBruijn graphs and cycle means
- Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
This page was built for publication: Maximum cycle-means of weighted digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920444)
