Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Artem Pyatkin"'
Autor:
Artem Pyatkin
Publikováno v:
Yugoslav Journal of Operations Research. 33:59-69
We consider the following 2-clustering problem. Given N points in Euclidean space, partition it into two subsets (clusters) so that the sum of squared distances between the elements of the clusters and their centers would be minimum. The center of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e506ae0f407eb28a4d004fd61a8ca320
https://doi.org/10.2298/yjor211018008p
https://doi.org/10.2298/yjor211018008p
Autor:
Sergey Kitaev, Artem Pyatkin
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative results f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17323fd3e64cdddd343ff8ec263fd3f8
http://arxiv.org/abs/2204.08936
http://arxiv.org/abs/2204.08936
Autor:
Sergey Kitaev, Artem Pyatkin
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$ exist for $1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9eefec093bf00993efa443b2b0800cd2
Publikováno v:
Journal of Global Optimization. 76:453-454
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85b8f4509e0b08523af11b74bc158297
https://doi.org/10.1007/s10898-020-00887-y
https://doi.org/10.1007/s10898-020-00887-y
Autor:
Artem Pyatkin, Adil I. Erzin
Publikováno v:
CSNDSP
We consider the problem of conflict-free data aggregation in distributed wireless radio networks, that is known as a Convergecast Scheduling Problem. This problem is strongly NP-hard in general. However the complexity status of the problem remained o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e35f61adde1c0c7347928c405105857
https://doi.org/10.1109/csndsp.2016.7574007
https://doi.org/10.1109/csndsp.2016.7574007
Publikováno v:
Journal of Discrete Algorithms. 14:136-149
Given an undirected graph G=(V,E), the (uniform, unweighted) sparsest cut problem is to find a vertex subset [email protected]?V minimizing |E(S,[email protected]?)|/(|S||[email protected]?|). We show that this problem is NP-complete, and give polyno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da399a9f946191f50808fdde1b57692c
https://doi.org/10.1016/j.jda.2011.12.008
https://doi.org/10.1016/j.jda.2011.12.008
Autor:
Artem Pyatkin, Alexei Vernitski
Publikováno v:
Journal of Discrete Algorithms. 12:24-28
The astral index of a graph is defined as the smallest number of astral graphs (also known as threshold graphs) into which the graph can be decomposed, divided by the number of vertices in the graph. The astral index is a promising new graph measure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9da0e6e7857c6e955cc67fff3d4898c7
Publikováno v:
Scopus-Elsevier
University of Strathclyde
University of Strathclyde
The notion of a word-representable graph has been studied in a series of papers in the literature. A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9811f45d805b8626cd545051ff005fb
https://doi.org/10.37236/4946
https://doi.org/10.37236/4946
Autor:
Artem Pyatkin
Publikováno v:
Journal of Graph Theory. 47:122-128
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f15b7944fcb42a63d2a303936ba1273d
https://doi.org/10.1002/jgt.20021
https://doi.org/10.1002/jgt.20021
Autor:
Artem Pyatkin
Publikováno v:
Journal of Graph Theory. 41:286-291
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::554d5f2c23203b4cc4c458d4c1e42e2d
https://doi.org/10.1002/jgt.10066
https://doi.org/10.1002/jgt.10066