Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
From MaRDI portal
Publication:1842405
zbMath0824.90134MaRDI QIDQ1842405
Publication date: 17 May 1995
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Games involving graphs (91A43)
Related Items (3)
The complexity of mean payoff games on graphs ⋮ New algorithms for solving tropical linear systems ⋮ Optimal paths in network games with \(p\) players
This page was built for publication: Strongly polynomial algorithms for finding minimax paths in networks and solution of cyclic games
