Zobrazeno 1 - 10
of 262
pro vyhledávání: '"Phan The Ha"'
Autor:
Do Duc Thuan, Dang Phuc Duc, Phan The Ha, Nguyen Thi Nguyet, Nguyen Dang Cuong, Nguyen Dang Hai, Nguyen Trong Nghia, Dao Van Nhat, Nguyen Khanh, Le Duy Chi, Pham Ngoc Thao
Publikováno v:
Interdisciplinary Neurosurgery, Vol 34, Iss , Pp 101811- (2023)
Background: Ischemic stroke caused by basilar artery occlusions (BAOs) poses a risk for misdiagnosis, leading to an increase the rates of mortality and disability, particularly in low-, and middle-income countries. Methods: A retrospective and cross-
Externí odkaz:
https://doaj.org/article/0ef96c2892534108b512cdd1924b3c7e
Autor:
Do, Duy Hieu, Phan, Thi Ha Duong
We will present improvements to famous algorithms for community detection, namely Newman's spectral method algorithm and the Louvain algorithm. The Newman algorithm begins by treating the original graph as a single cluster, then repeats the process t
Externí odkaz:
http://arxiv.org/abs/2403.08313
Autor:
Hieu, Do Duy, Duong, Phan Thi Ha
The issue of network community detection has been extensively studied across many fields. Most community detection methods assume that nodes belong to only one community. However, in many cases, nodes can belong to multiple communities simultaneously
Externí odkaz:
http://arxiv.org/abs/2403.08000
Autor:
Nguyen, Nhat Minh, Dang, Vinh Quang, Tran, Cong Khanh, La, Phan Phuong Ha, Bui, Thi Thu Thao, Vuong, Thanh Tuyen, Seo, Hyungtak, Duy, Le Thai
Publikováno v:
In Materials Chemistry and Physics 1 August 2024 322
Autor:
Khai, Hoang Dac, Hiep, Phan Phuoc Minh, Nguyen, Phan Le Ha, Hoa, Ho Cam Khanh, Thuy, Nguyen Thi Thanh, Mai, Nguyen Thi Nhu, Cuong, Do Manh, Tung, Hoang Thanh, Luan, Vu Quoc, Vinh, Bui Van The, Van Hoang, Cao, Nhut, Duong Tan
Publikováno v:
In Scientia Horticulturae 1 March 2024 327
Autor:
Phan La, Ha Phuong, Thi Tran, Kieu Thuy, Hoang Nguyen, Long Bao, Van Tran, Man, Van Pham, Viet
Publikováno v:
In International Journal of Hydrogen Energy 2 January 2024 52 Part A:482-493
Publikováno v:
Discrete Applied Mathematics 195, 2015
We define a new graph operator, called the weak-factor graph, which comes from the context of complex network modelling. The weak-factor operator is close to the well-known clique-graph operator but it rather operates in terms of bicliques in a multi
Externí odkaz:
http://arxiv.org/abs/2103.04451
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs. However, th
Externí odkaz:
http://arxiv.org/abs/2103.04447
We design two incremental algorithms for computing an inclusion-minimal completion of an arbitrary graph into a cograph. The first one is able to do so while providing an additional property which is crucial in practice to obtain inclusion-minimal co
Externí odkaz:
http://arxiv.org/abs/2001.07765
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.