论文信息 - Maximum cycle-means of weighted digraphs

Maximum cycle-means of weighted digraphs

Computing the maximum cycle-mean of a weighted digraph is relevant to a number of applications, and combinatorial algorithms of complexityO(n3) are known. We present a new algorithm, with computational evidence to suggest an expected run-time growth rate belowO(n3).

Yixun Lin | R. A. Cuninghame-Green | R. Cuninghame-Green | Yixun Lin

[1] R. A. Cuninghame-Green,et al. Describing Industrial Processes with Interference and Approximating Their Steady-State Behaviour , 1962 .

[2] Eric O. Postma. Optimization Networks , 1995, Artificial Neural Networks.

[3] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[4] R. Griffiths,et al. Numerical procedure for solving a minimization eigenvalue problem , 1989 .

[5] Griffiths,et al. Effective potentials: A new approach and new results for one-dimensional systems with competing length scales. , 1986, Physical review letters.

[6] Peter Butkovic,et al. An O(n2) algorithm for the maximum cycle mean of an n×n bivalent matrix , 1992, Discret. Appl. Math..

[7] M. Golitschek. Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones , 1982 .