Zobrazeno 1 - 10
of 3 827
pro vyhledávání: '"YUAN Long"'
Bipartite graphs are commonly used to model relationships between two distinct entities in real-world applications, such as user-product interactions, user-movie ratings and collaborations between authors and publications. A butterfly (a 2x2 bi-cliqu
Externí odkaz:
http://arxiv.org/abs/2412.11488
Community search over bipartite graphs is a fundamental problem, and finding influential communities has attracted significant attention. However, all existing studies have used the minimum weight of vertices as the influence of communities. This lea
Externí odkaz:
http://arxiv.org/abs/2412.06216
Top-k Nearest Neighbors (kNN) problem on road network has numerous applications on location-based services. As direct search using the Dijkstra's algorithm results in a large search space, a plethora of complex-index-based approaches have been propos
Externí odkaz:
http://arxiv.org/abs/2408.05432
Autor:
Meng, Lingkai, Shao, Yu, Yuan, Long, Lai, Longbin, Cheng, Peng, Li, Xue, Yu, Wenyuan, Zhang, Wenjie, Lin, Xuemin, Zhou, Jingren
Distributed processing of large-scale graph data has many practical applications and has been widely studied. In recent years, a lot of distributed graph processing frameworks and algorithms have been proposed. While many efforts have been devoted to
Externí odkaz:
http://arxiv.org/abs/2404.06037
We determine the maximum number of a graph without containing the 2-power of a Hamilton path. Using this result, we establish a spectral condition for a graph containing the 2-power of a Hamilton path.
Externí odkaz:
http://arxiv.org/abs/2403.05040
Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing performance of a single query. However, in practice, it is more often that mu
Externí odkaz:
http://arxiv.org/abs/2312.01424
Structural clustering is one of the most popular graph clustering methods, which has achieved great performance improvement by utilizing GPUs. Even though, the state-of-the-art GPU-based structural clustering algorithm, GPUSCAN, still suffers from ef
Externí odkaz:
http://arxiv.org/abs/2311.12281
Autor:
Yuan, Long, Hu, Qiya
In this paper we propose a {\it discontinuous} plane wave neural network (DPWNN) method with $hp-$refinement for approximately solving Helmholtz equation and time-harmonic Maxwell equations. In this method, we define a quadratic functional as in the
Externí odkaz:
http://arxiv.org/abs/2310.09527
Autor:
Ma, Jie, Yuan, Long-Tu
The supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erd\H{o}s, and Lov\'{a}sz and Simonovits determine the optimal ra
Externí odkaz:
http://arxiv.org/abs/2310.08081