Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Xu Xirong"'
Influence maximization (IM) is a crucial optimization task related to analyzing complex networks in the real world, such as social networks, disease propagation networks, and marketing networks. Publications to date about the IM problem focus mainly
Externí odkaz:
http://arxiv.org/abs/2405.09185
Influence Maximization problem has received significant attention in recent years due to its application in various do?mains such as product recommendation, public opinion dissemination, and disease propagation. This paper proposes a theoretical anal
Externí odkaz:
http://arxiv.org/abs/2306.13458
Autor:
Li, Fang a, 1, Xie, Li b, c, 1, Xiao, Qian b, 1, Li, Jingguang d, Zhong, Huifang a, Xu, Xirong b, e, Tu, Jie b, e, f, g, ⁎, Luo, Qian a, e, ⁎
Publikováno v:
In Science of the Total Environment 1 December 2024 954
Autor:
Duan, Chenming a, #, Wu, Zhichao a, #, Zhu, Li b, ⁎, Xu, Xirong a, Zhu, Jianmin c, Wei, Ziqi d, ⁎, Yang, Xin a, ⁎
Publikováno v:
In Knowledge-Based Systems 19 July 2024 296
Astrocyte-mediated regulation of BLAWFS1 neurons alleviates risk-assessment deficits in DISC1-N mice
Autor:
Zhou, Xinyi 1, 3, 4, 9, Xiao, Qian 1, 2, 7, 9, Liu, Yaohui 1, 8, Chen, Shuai 6, Xu, Xirong 1, 6, Zhang, Zhigang 1, 2, 7, Hong, Yuchuan 1, 6, Shao, Jie 1, 3, 4, Chen, Yuewen 1, 6, 7, Chen, Yu 1, 6, 7, Wang, Liping 1, 5, 6, 7, ∗, Yang, Fan 1, 5, 6, 7, ∗∗, Tu, Jie 1, 2, 5, 6, 7, 10, ∗∗∗
Publikováno v:
In Neuron 3 July 2024 112(13):2197-2217
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.
The twisted hypercube-like networks($THLNs$) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of $n$-dimensional($n$-$D$) $THLNs$. Let $G_n$ be an $n$-$D$ $THLN$ and $F$ be a subset of $V(G_
Externí odkaz:
http://arxiv.org/abs/1906.05069
Autor:
Xu, Xirong1 (AUTHOR) xirongxu@dlut.edu.cn, Xu, Tao1 (AUTHOR), Wang, Ziming1 (AUTHOR), Li, Haochen1 (AUTHOR), Zhu, Li2 (AUTHOR), Wei, Xiaopeng1 (AUTHOR)
Publikováno v:
Neural Computing & Applications. Feb2024, Vol. 36 Issue 4, p2015-2028. 14p.
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.
Autor:
Wang, Jian, Xu, Xirong
The decycling number of a graph $G$ is the minimum number of vertices whose removal from $G$ results in an acyclic subgraph. It is known that determining the decycling number of a graph $G$ is equivalent to finding the maximum induced forests of $G$.
Externí odkaz:
http://arxiv.org/abs/1701.01953