Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
952 2 |
Ultima descărcare din IBN: 2017-04-29 14:30 |
Căutarea după subiecte similare conform CZU |
517.98+519.7+519.8 (1) |
Дифференциальные, интегральные и другие функциональные уравнения. Конечные разности. Вариационное исчисление. Функциональный анализ (242) |
Математическая кибернетика (93) |
Исследование операций (169) |
SM ISO690:2012 LOZOVANU, Dmitrii. Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
. In: Computer Science Journal of Moldova, 2005, nr. 2(38), pp. 115-130. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 2(38) / 2005 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 517.98+519.7+519.8 | ||||||
Pag. 115-130 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
We study the max-min paths problem, which represents a
game version of the shortest and the longest paths problem in a
weighted directed graph. In this problem the vertex set V of the
weighted directed graph G = (V;E) is divided into two disjoint
subsets VA and VB which are regarded as positional sets of two
players. The players are seeking for a directed path from the
given starting position v0 to the final position vf , where the first
player intends to maximize the integral cost of the path while the
second one has aim to minimize it. Polynomial-time algorithm
for determining max-min path in networks is proposed and its
application for solving zero value cyclic games is developed.
Mathematics Subject Classification 2000: 90B10, 90C35,
90C27. |
||||||
Cuvinte-cheie max-min path, c–game on networks, positional games |
||||||
|