Zobrazeno 1 - 10
of 266
pro vyhledávání: '"Gregory Gutin"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 44, Iss 3, p 913 (2024)
Externí odkaz:
https://doaj.org/article/754f114aa59144369d1f6c88209db14f
Publikováno v:
Theoretical Computer Science. 941:180-190
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb9888dbf461d808ea8b2adfa6090e31
https://doi.org/10.1016/j.tcs.2022.11.013
https://doi.org/10.1016/j.tcs.2022.11.013
Publikováno v:
Theoretical Computer Science. 936:148-171
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82dbdbe6dc286fee5464cb70899957fc
https://doi.org/10.1016/j.tcs.2022.09.024
https://doi.org/10.1016/j.tcs.2022.09.024
Publikováno v:
IEEE Transactions on Information Theory. 68:3870-3878
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdd4458da36f6d2a0f8fa6eeee07140a
https://doi.org/10.1109/tit.2022.3145232
https://doi.org/10.1109/tit.2022.3145232
Autor:
Daniel Karapetyan, Gregory Gutin
Publikováno v:
IEEE Transactions on Dependable and Secure Computing. :1-12
The workflow satisfiability problem (WSP) is a well-studied problem in access control seeking allocation of authorised users to every step of the workflow, subject to workflow specification constraints. It was noticed that the number $k$ of steps is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31caf49a6a394150dadf075da87e4e09
https://doi.org/10.1109/tdsc.2022.3227241
https://doi.org/10.1109/tdsc.2022.3227241
Publikováno v:
Journal of Graph Theory. 99:82-89
In his paper "Kings in Bipartite Hypertournaments" (Graphs $\&$ Combinatorics 35, 2019), Petrovic stated two conjectures on 4-kings in multipartite hypertournaments. We prove one of these conjectures and give counterexamples for the other.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::23c36097b217a069afff60db89942763
https://doi.org/10.1002/jgt.22726
https://doi.org/10.1002/jgt.22726
Publikováno v:
Journal of Combinatorial Optimization. 44:2499-2514
Due to their ubiquity and extensive applications, graph routing problems have been widely studied in the fields of operations research, computer science and engineering. An important example of a routing problem is the traveling salesman problem. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72f0cbdf271853a92ae6cc3b5454b5d8
https://doi.org/10.1007/s10878-021-00772-8
https://doi.org/10.1007/s10878-021-00772-8
Publikováno v:
Proceedings of the 27th ACM on Symposium on Access Control Models and Technologies.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90e27094b65b91e482c1c662f19663de
https://doi.org/10.1145/3532105.3535024
https://doi.org/10.1145/3532105.3535024
Autor:
Yuefang Sun, Gregory Gutin
Publikováno v:
Graphs and Combinatorics. 37:951-970
Let $$D=(V,A)$$ D = ( V , A ) be a digraph of order n, S a subset of V of size k and $$2\le k\le n$$ 2 ≤ k ≤ n . A strong subgraph H of D is called an S-strong subgraph if $$S\subseteq V(H)$$ S ⊆ V ( H ) . A pair of S-strong subgraphs $$D_1$$ D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09e632e0e7dafe1b9dc9d91cf76bb66e
https://doi.org/10.1007/s00373-021-02294-w
https://doi.org/10.1007/s00373-021-02294-w
Autor:
Bin Sheng, Gregory Gutin
Publikováno v:
Theoretical Computer Science. 953:113798
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2466e95e914249e720735b480ff900f8
https://doi.org/10.1016/j.tcs.2023.113798
https://doi.org/10.1016/j.tcs.2023.113798