Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Boštjan Gabrovšek"'
Autor:
Boštjan Gabrovšek, Janez Žerovnik
Publikováno v:
Croatian Operational Research Review, Vol 15, Iss 2, Pp 105-117 (2024)
Petford and Welsh introduced a sequential heuristic algorithm to provide an approximate solution to the NP-hard graph coloring problem. The algorithm is based on the antivoter model and mimics the behavior of a physical process based on a multi-parti
Externí odkaz:
https://doaj.org/article/12d812f88ced47459be97c00b6e54539
Publikováno v:
Mathematics, Vol 8, Iss 11, p 2050 (2020)
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k≥3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al., in: G
Externí odkaz:
https://doaj.org/article/6285a8cf440d4079bb5daa0f3a4d4ae1
Publikováno v:
Mathematics, Vol 8, Iss 6, p 996 (2020)
We obtain new results on independent 2- and 3-rainbow domination numbers of generalized Petersen graphs P ( n , k ) for certain values of n , k ∈ N . By suitably adjusting and applying a well established technique of tropical algebra (path algebra)
Externí odkaz:
https://doaj.org/article/05f7f6174028498287dcadbf8479bb80
Autor:
Boštjan Gabrovšek, Neslihan Gügümcü
Publikováno v:
Mediterranean Journal of Mathematics. 20
In this paper, we extend the definition of a knotoid that was introduced by Turaev, to multi-linkoids that consist of a number of knot and knotoid components. We study invariants of multi-linkoids that lie in a closed orientable surface, namely the K
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b908cf411773cb835f0a78f1dfb4b90
https://doi.org/10.1007/s00009-023-02370-w
https://doi.org/10.1007/s00009-023-02370-w
Publikováno v:
Central European Journal of Operations Research.
By suitably adjusting the tropical algebra technique we compute the rainbow independent domination numbers of several infinite families of graphs including Cartesian products $$C_n \Box P_m$$ C n □ P m and $$C_n \Box C_m$$ C n □ C m for all n and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff2bf47142a0dd427316fbb08e06e9b4
https://doi.org/10.1007/s10100-023-00840-w
https://doi.org/10.1007/s10100-023-00840-w
Publikováno v:
Computational and Applied Mathematics. 41
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c50f71d70f7ea9b9fab1d433cc52138
https://doi.org/10.1007/s40314-022-01835-0
https://doi.org/10.1007/s40314-022-01835-0
Publikováno v:
Nonlinear Analysis. 186:33-54
In this paper, we consider the following nonlinear Kirchhoff type problem: − a + b ∫ R 3 | ∇ u | 2 Δ u + V ( x ) u = f ( u ) , in R 3 , u ∈ H 1 ( R 3 ) , where a , b > 0 are constants, the nonlinearity f is superlinear at infinity with subcr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8499c4dea0c4e42e0f5e6a0b8faacb1
https://doi.org/10.1016/j.na.2018.10.007
https://doi.org/10.1016/j.na.2018.10.007
Publikováno v:
Mathematics
Volume 8
Issue 11
Mathematics, vol. 8, no. 11, 2050, 2020.
Mathematics, Vol 8, Iss 2050, p 2050 (2020)
Volume 8
Issue 11
Mathematics, vol. 8, no. 11, 2050, 2020.
Mathematics, Vol 8, Iss 2050, p 2050 (2020)
The k-assignment problem (or, the k-matching problem) on k-partite graphs is an NP-hard problem for k&ge
3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al.,
3. In this paper we introduce five new heuristics. Two algorithms, Bm and Cm, arise as natural improvements of Algorithm Am from (He et al.,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5394acfefa3d2f560d3902fc0bf9246d
Autor:
Eva Horvat, Boštjan Gabrovšek
Publikováno v:
Journal of knot theory and its ramifications, vol. 28, no. 8, pp. 1-28, 2019.
We show how the Alexander polynomial of links in lens spaces is related to the classical Alexander polynomial of a link in the 3-sphere, obtained by cutting out the exceptional lens space fibre. It follows from these relationship that a certain norma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ac3d20cc00b7fad9c89e6adff7a707c
https://repozitorij.uni-lj.si/IzpisGradiva.php?id=116713
https://repozitorij.uni-lj.si/IzpisGradiva.php?id=116713
