Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Mezei, Tamás Róbert"'
Partite, $3$-uniform hypergraphs are $3$-uniform hypergraphs in which each hyperedge contains exactly one point from each of the $3$ disjoint vertex classes. We consider the degree sequence problem of partite, $3$-uniform hypergraphs, that is, to dec
Externí odkaz:
http://arxiv.org/abs/2308.13251
An independent vertex subset $S$ of the directed graph $G$ is a kernel if the set of out-neighbors of $S$ is $V(G)\setminus S$. An independent vertex subset $Q$ of $G$ is a quasi-kernel if the union of the first and second out-neighbors contains $V(G
Externí odkaz:
http://arxiv.org/abs/2307.04112
Autor:
Mezei, Tamás Róbert
We solve the $r$-star covering problem in simple orthogonal polygons, also known as the point guard problem in simple orthogonal polygons with rectangular vision, in quadratic time.
Comment: 28 pages, 5 figures
Comment: 28 pages, 5 figures
Externí odkaz:
http://arxiv.org/abs/2304.13699
Autor:
Erdős, Péter L., Mezei, Tamás Róbert
Publikováno v:
Algorithms 2023, Volume 16, Issue 7, 341
In contemporary wireless communication networks, base-stations are organized into coordinated clusters (called cells) to jointly serve the users. However, such fixed systems are plagued by the so-called cell-edge problem: near the boundaries, the int
Externí odkaz:
http://arxiv.org/abs/2212.10129
Publikováno v:
Ann. Comb. (2023)
The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One approach is using Markov chains. The best available current result abo
Externí odkaz:
http://arxiv.org/abs/2204.09493
The recently introduced Degree Preserving Growth model (Nature Physics, DOI:10.1038/s41567-021-01417-7) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. In this paper we are present
Externí odkaz:
http://arxiv.org/abs/2204.07423
We propose a simple and fast method for providing a high quality solution for the sum-interference minimization problem. As future networks are deployed in high density urban areas, improved clustering methods are needed to provide low interference n
Externí odkaz:
http://arxiv.org/abs/2111.00885
Autor:
Hubai, András1 (AUTHOR), Mezei, Tamás Róbert1 (AUTHOR), Béres, Ferenc2 (AUTHOR), Benczúr, András2,3 (AUTHOR), Miklós, István1,2 (AUTHOR) miklos.istvan@renyi.hu
Publikováno v:
PLoS ONE. 5/15/2024, Vol. 19 Issue 5, p1-27. 27p.
Publikováno v:
Discrete Applied Mathematics, Volume 294, 15 May 2021, Pages 205-213
We show that the space of rooted tree-based phylogenetic networks is connected under rooted nearest-neighbour interchange (rNNI) moves.
Comment: Fixed typos and references to labels in the last subsection
Comment: Fixed typos and references to labels in the last subsection
Externí odkaz:
http://arxiv.org/abs/2003.07283
Publikováno v:
The Electronic Journal of Combinatorics, Volume 28, Issue 3 (2021) P3.7
One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain converges to the uniform distribution, but generally the rate of converge
Externí odkaz:
http://arxiv.org/abs/1909.02308