Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Do, Tuan Anh"'
The random coloured graph $G_c(n,p)$ is obtained from the Erd\H{o}s-R\'{e}nyi binomial random graph $G(n,p)$ by assigning to each edge a colour from a set of $c$ colours independently and uniformly at random. It is not hard to see that, when $c = \Th
Externí odkaz:
http://arxiv.org/abs/2210.11972
In this note, we consider the width of a supercritical random graph according to some commonly studied width measures. We give short, direct proofs of results of Lee, Lee and Oum, and of Perarnau and Serra, on the rank- and tree-width of the random g
Externí odkaz:
http://arxiv.org/abs/2202.06087
Publikováno v:
In Computers and Operations Research July 2024 167
The binomial random bipartite graph $G(n,n,p)$ is the random graph formed by taking two partition classes of size $n$ and including each edge between them independently with probability $p$. It is known that this model exhibits a similar phase transi
Externí odkaz:
http://arxiv.org/abs/2105.14883
Autor:
Do, Tuan Anh
Les développeurs d'applications Web ne sont pas tous des experts. Même s'ils utilisent des méthodes telles que UWE (UML web engineering) et les outils CASE, ils ne sont pas toujours capables de prendre de bonnes décisions concernant le contenu de
Externí odkaz:
http://www.theses.fr/2018CNAM1201/document
The genus of the binomial random graph $G(n,p)$ is well understood for a wide range of $p=p(n)$. Recently, the study of the genus of the random bipartite graph $G(n_1,n_2,p)$, with partition classes of size $n_1$ and $n_2$, was initiated by Mohar and
Externí odkaz:
http://arxiv.org/abs/2005.03920
Autor:
Do, Tuan Anh1,2 (AUTHOR) anh.dt220032d@sis.hust.edu.vn, Nguyen, Quang Dich2 (AUTHOR), Vu, Phuong1 (AUTHOR) phuong.vuhoang@hust.edu.vn, Ngo, Minh Duc3 (AUTHOR) phuong.vuhoang@hust.edu.vn, Ahn, Seon-Ju4 (AUTHOR) phuong.vuhoang@hust.edu.vn
Publikováno v:
Energies (19961073). Jan2024, Vol. 17 Issue 2, p375. 20p.
Publikováno v:
Evolutionary Intelligence; Jun2024, Vol. 17 Issue 3, p1547-1566, 20p
Publikováno v:
Journal of Graph Theory; Jun2024, Vol. 106 Issue 2, p273-295, 23p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.