Zobrazeno 1 - 10
of 436
pro vyhledávání: '"Kang Liying"'
Autor:
Zhang, Peiyan, Jin, Haibo, Hu, Leyang, Li, Xinnuo, Kang, Liying, Luo, Man, Song, Yangqiu, Wang, Haohan
Recent advancements in large language models (LLMs) have significantly enhanced the ability of LLM-based systems to perform complex tasks through natural language processing and tool interaction. However, optimizing these LLM-based systems for specif
Externí odkaz:
http://arxiv.org/abs/2412.03092
Autor:
Xue, Yisai, Kang, Liying
The generalized Tur\'an number $\mathrm{ex}(n, H, \mathcal{F})$ is defined as the maximum number of copies of a graph $H$ in an $n$-vertex graph that does not contain any graph $F \in \mathcal{F}$. Alon and Frankl initiated the study of Tur\'an probl
Externí odkaz:
http://arxiv.org/abs/2410.12338
Tait and Tobin [J. Combin. Theory Ser. B 126 (2017) 137--161] determined the unique spectral extremal graph over all outerplanar graphs and the unique spectral extremal graph over all planar graphs when the number of vertices is sufficiently large. I
Externí odkaz:
http://arxiv.org/abs/2410.00310
The spectral Tur\'an theorem states that the $k$-partite Tur\'an graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no the complete graph $K_{k+1}$ as a subgraph. This result is known to
Externí odkaz:
http://arxiv.org/abs/2408.03122
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 3, Pp 695-712 (2020)
The problem of monitoring an electric power system by placing as few measurement devices in the system can be formulated as a power dominating set problem in graph theory. The power domination number of a graph is the minimum cardinality of a power d
Externí odkaz:
https://doaj.org/article/717bc02a822a4b06838aaf4b33994808
Autor:
Zhang, Peiyan, Yan, Yuchen, Zhang, Xi, Kang, Liying, Li, Chaozhuo, Huang, Feiran, Wang, Senzhang, Kim, Sunghun
In the realm of personalized recommender systems, the challenge of adapting to evolving user preferences and the continuous influx of new users and items is paramount. Conventional models, typically reliant on a static training-test approach, struggl
Externí odkaz:
http://arxiv.org/abs/2406.08229
Autor:
Kang Liying, Shan Erfang
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 811-828 (2018)
A subtree S of a tree T is a central subtree of T if S has the minimum eccentricity in the join-semilattice of all subtrees of T. Among all subtrees lying in the join-semilattice center, the subtree with minimal size is called the least central subtr
Externí odkaz:
https://doaj.org/article/1d0b9f269f9a4123b4a7f1ea581bd4d8
Autor:
Lu, Yongchun, Kang, Liying
Given a family of graphs $\mathcal{F}$, the Tur\'{a}n number $ex(n, \mathcal{F})$ denotes the maximum number of edges in any $\mathcal{F}$-free graph on $n$ vertices. Recently, Alon and Frankl studied of maximum number of edges in an $n$-vertex $\{K_
Externí odkaz:
http://arxiv.org/abs/2404.05942
Let $F$ be a graph and let $\mathcal{B}_r(F)$ be the class of $r$-uniform Berge-$F$ hypergraphs. In this paper, by establishing a relationship between the spectral radius of the adjacency tensor of a uniform hypergraph and its local structure via wal
Externí odkaz:
http://arxiv.org/abs/2403.02064
Autor:
Zhang, Peiyan, Li, Chaozhuo, Kang, Liying, Huang, Feiran, Wang, Senzhang, Xie, Xing, Kim, Sunghun
We investigate node representation learning on text-attributed graphs (TAGs), where nodes are associated with text information. Although recent studies on graph neural networks (GNNs) and pretrained language models (PLMs) have exhibited their power i
Externí odkaz:
http://arxiv.org/abs/2402.16240