Zobrazeno 1 - 10
of 1 602
pro vyhledávání: '"Peng, You"'
Autor:
Wei-Yi Zhang, Jia Chen, Hong-Ming Liu, Xin-Hong Jiang, Zhi-Ping Chen, Zhi-Peng You, Yu-Ling Zou
Publikováno v:
International Journal of Ophthalmology, Vol 17, Iss 11, Pp 2141-2144 (2024)
Externí odkaz:
https://doaj.org/article/552dc50c286a4990a4acfede4188c4db
The widespread use of graph data in various applications and the highly dynamic nature of today's networks have made it imperative to analyze structural trends in dynamic graphs on a continual basis. The shortest path is a fundamental concept in grap
Externí odkaz:
http://arxiv.org/abs/2307.05918
In modern graph analytics, the shortest path is a fundamental concept. Numerous \rrev{recent works} concentrate mostly on the distance of these shortest paths. Nevertheless, in the era of betweenness analysis, the counting of the shortest path betwee
Externí odkaz:
http://arxiv.org/abs/2212.00977
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are naturally associated with edges in the graphs and finding the shortest
Externí odkaz:
http://arxiv.org/abs/2211.08648
The Feedback vertex set with the minimum size is one of Karp's 21 NP-complete problems targeted at breaking all the cycles in a graph. This problem is applicable to a broad variety of domains, including E-commerce networks, database systems, and prog
Externí odkaz:
http://arxiv.org/abs/2209.05909
With the ever-increasing prevalence of graph data in a wide spectrum of applications, it becomes essential to analyze structural trends in dynamic graphs on a continual basis. The shortest cycle is a fundamental pattern in graph analytics. In this pa
Externí odkaz:
http://arxiv.org/abs/2207.01035
Community search is a problem that seeks cohesive and connected subgraphs in a graph that satisfy certain topology constraints, e.g., degree constraints. The majority of existing works focus exclusively on the topology and ignore the nodes' influence
Externí odkaz:
http://arxiv.org/abs/2207.01029
Publikováno v:
Photodiagnosis and Photodynamic Therapy, Vol 48, Iss , Pp 104278- (2024)
Background: To investigate the long-term corneal stromal remodeling and central stromal thickness (CST) reduction accuracy after small-incision lenticule extraction (SMILE) for high myopia correction. Methods: This prospective study included 30 patie
Externí odkaz:
https://doaj.org/article/d420416f7dc44b298d20405292ab6c91
Listing all k-cliques is a fundamental problem in graph mining, with applications in finance, biology, and social network analysis. However, owing to the exponential growth of the search space as k increases, listing all k-cliques is algorithmically
Externí odkaz:
http://arxiv.org/abs/2203.13512
Publikováno v:
In Journal of Retailing and Consumer Services November 2024 81