Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Marek Kubale"'
Autor:
Hanna Furmańczyk, Marek Kubale
Publikováno v:
Archives of Control Sciences, Vol vol. 34, Iss No 1, Pp 211-223 (2024)
A graph G is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest integer k for which such a coloring exists is known as the equ
Externí odkaz:
https://doaj.org/article/11ff78603aa34800a637a171c6fea659
Autor:
Hanna Furmańczyk, Marek Kubale
Publikováno v:
Discrete Applied Mathematics. 237:116-122
A $k$-coloring of a graph $G=(V,E)$ is called semi-equitable if there exists a partition of its vertex set into independent subsets $V_1,\ldots,V_k$ in such a way that $|V_1| \notin \{\lceil |V|/k\rceil, \lfloor |V|/k \rfloor\}$ and $||V_i|-|V_j|| \l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71bc3a91191873f6de8089186b869c95
https://doi.org/10.1016/j.dam.2017.12.002
https://doi.org/10.1016/j.dam.2017.12.002
Autor:
Marek Kubale, Hanna Furmańczyk
Publikováno v:
Bulletin of the Polish Academy of Sciences Technical Sciences. 65:29-34
In the paper we consider the problem of scheduling n identical jobs on 4 uniform machines with speeds s1 ≥ s2 ≥ s3 ≥ s4, respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c657b43804e712b2a8d9b1b09ab5e4f3
https://doi.org/10.1515/bpasts-2017-0004
https://doi.org/10.1515/bpasts-2017-0004
Publikováno v:
Archives of Control Sciences, Vol 26, Iss 3, Pp 281-295 (2016)
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::085aef86d10a8e22916e9e1867f76071
https://doi.org/10.1515/acsc-2016-0016
https://doi.org/10.1515/acsc-2016-0016
Autor:
Tytus Pikies, Marek Kubale
Publikováno v:
Applied Mathematics and Computation. 375:125073
Given a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a1739540f51c19c57a1d4a4f7df4eec
https://doi.org/10.1016/j.amc.2020.125073
https://doi.org/10.1016/j.amc.2020.125073
Autor:
Marek Kubale, Krzysztof Giaro
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 885-891 (2020)
In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e69b36dc98f7b916ad6474cfc099697d
https://doi.org/10.7151/dmgt.2215
https://doi.org/10.7151/dmgt.2215
Publikováno v:
Bulletin of the Polish Academy of Sciences Technical Sciences. 63:739-744
In this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a755759e95a7e5e7a8692dcc96d360d6
https://doi.org/10.1515/bpasts-2015-0085
https://doi.org/10.1515/bpasts-2015-0085
Publikováno v:
Foundations of Computing and Decision Sciences, Vol 40, Iss 2, Pp 133-141 (2015)
In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C 10 2)√3) = 30 and α((C 14 4)√3) = 14. A number of optimizations have been introd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a275cd73e48a7c190b57cc7849dc5d4
https://doaj.org/article/f381b1bfddd548ec804b3873a50042e8
https://doaj.org/article/f381b1bfddd548ec804b3873a50042e8
Autor:
Hanna Furmańczyk, Marek Kubale
Publikováno v:
Archives of Control Sciences, Vol 25, Iss 1, Pp 109-116 (2015)
In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e6c8cb0292bd1d5cb84ca8e71462470
http://www.degruyter.com/view/j/acsc.2015.25.issue-1/acsc-2015-0007/acsc-2015-0007.xml?format=INT
http://www.degruyter.com/view/j/acsc.2015.25.issue-1/acsc-2015-0007/acsc-2015-0007.xml?format=INT