✦ LIBER ✦

Cyclic games and an algorithm to find minimax cycle means in directed graphs

✍ Scribed by V.A. Gurvich; A.V. Karzanov; L.G. Khachivan

Publisher: Elsevier Science
Year: 1988
Weight: 796 KB
Volume: 28
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(88)90012-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Parallel Algorithm for Find

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB

An algorithm of propagation in weighted

An algorithm of propagation in weighted directed graphs with applications to economics and finance

✍ Mario Eboli 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

This paper puts forward an algorithm that computes the diffusion of events and actions across networks of economic agents, an algorithm that is applicable when such networks can be represented as weighted directed graphs. The functioning of the algorithm is shown in three applications. First, the al