Zobrazeno 1 - 10
of 237
pro vyhledávání: '"Raidl, Günther R."'
Publikováno v:
Applied Mathematics and Computation, Volume 471, 2024, page 128612
The signed double Roman domination problem is a combinatorial optimization problem on a graph asking to assign a label from $\{\pm{}1,2,3\}$ to each vertex feasibly, such that the total sum of assigned labels is minimized. Here feasibility is given w
Externí odkaz:
http://arxiv.org/abs/2308.01109
Publikováno v:
In Computers and Operations Research July 2024 167
Publikováno v:
In Applied Mathematics and Computation 15 June 2024 471
Autor:
Djukanović, Marko, Kartelj, Aleksandar, Matić, Dragan, Grbić, Milana, Blum, Christian, Raidl, Günther R.
Publikováno v:
In Applied Soft Computing Journal June 2022 122
Publikováno v:
In Computers and Operations Research February 2021 126
Publikováno v:
In Procedia Computer Science 2021 180:517-524
Publikováno v:
In Procedia Computer Science 2021 180:366-370
Autor:
Blum, Christian, Raidl, Günther R.
In the minimum common string partition (MCSP) problem two related input strings are given. "Related" refers to the property that both strings consist of the same set of letters appearing the same number of times in each of the two strings. The MCSP s
Externí odkaz:
http://arxiv.org/abs/1501.02388
Publikováno v:
In Applied Soft Computing Journal October 2020 95
Publikováno v:
In Discrete Applied Mathematics 15 September 2020 283:242-264