Zobrazeno 1 - 10
of 546
pro vyhledávání: '"polynomial algorithms"'
Autor:
Benerecetti, Massimo a, Dell'Erba, Daniele b, ⁎, Mogavero, Fabio a, Schewe, Sven b, Wojtczak, Dominik b
Publikováno v:
In Journal of Computer and System Sciences February 2025 147
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 6-12 (2024)
Externí odkaz:
https://doaj.org/article/2310eb3d38b34c04bc00fff3df79bd8e
Publikováno v:
Axioms, Vol 13, Iss 2, p 127 (2024)
In this paper, the generalized widest path problem (or generalized maximum capacity problem) is studied. This problem is denoted by the GWPP. The classical widest path problem is to find a path from a source (s) to a sink (t) with the highest capacit
Externí odkaz:
https://doaj.org/article/e0b2ddfe877949acad1dbc4f1471292d
Autor:
Bhore, Sujoy a, Chakraborty, Sourav b, Jana, Satyabrata b, Mitchell, Joseph S.B. c, 1, Pandit, Supantha d, ⁎, 2, Roy, Sasanka b
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:111-120
Publikováno v:
In Theoretical Computer Science 3 September 2021 883:59-68
Autor:
Daniele Dell'Erba, Sven Schewe
Publikováno v:
Frontiers in Computer Science, Vol 4 (2022)
Calude et al. have recently shown that parity games can be solved in quasi-polynomial time, a landmark result that has led to several approaches with quasi-polynomial complexity. Jurdzinski and Lazic have further improved the precise complexity of pa
Externí odkaz:
https://doaj.org/article/8e8f481199da482f83c116525ad1a18e
Autor:
Feder, Tomás a, Hell, Pavol b, ⁎
Publikováno v:
In Discrete Applied Mathematics 15 July 2020 281:235-245
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In European Journal of Operational Research 16 May 2019 275(1):35-44